메뉴 건너뛰기




Volumn 14, Issue , 2012, Pages 57-83

A general Datalog-based framework for tractable query answering over ontologies

Author keywords

Chase; Conjunctive queries; Constraints; Datalog; DL Lite; Ontologies

Indexed keywords

CHASE; CONJUNCTIVE QUERIES; CONSTRAINTS; DATALOG; DL-LITE;

EID: 84862010071     PISSN: 15708268     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.websem.2012.03.001     Document Type: Article
Times cited : (387)

References (105)
  • 1
    • 18144386595 scopus 로고    scopus 로고
    • Data exchange: Semantics and query answering
    • DOI 10.1016/j.tcs.2004.10.033, PII S030439750400725X
    • R. Fagin, P.G. Kolaitis, R.J. Miller, and L. Popa Data exchange: semantics and query answering Theoret. Comput. Sci. 336 1 2005 89 124 (Pubitemid 40612385)
    • (2005) Theoretical Computer Science , vol.336 , Issue.1 , pp. 89-124
    • Fagin, R.1    Kolaitis, P.G.2    Miller, R.J.3    Popa, L.4
  • 2
    • 10044279569 scopus 로고    scopus 로고
    • Open constraint programming
    • B. Faltings, and S. Macho-Gonzalez Open constraint programming Artif. Intell. 161 1/2 2005 181 208
    • (2005) Artif. Intell. , vol.161 , Issue.1-2 , pp. 181-208
    • Faltings, B.1    MacHo-Gonzalez, S.2
  • 3
    • 0032158242 scopus 로고    scopus 로고
    • A classification and constraint-based framework for configuration
    • D. Mailharrow A classification and constraint-based framework for configuration Artif. Intell. Eng. Des. Anal. Manuf. 12 4 1998 383 397
    • (1998) Artif. Intell. Eng. Des. Anal. Manuf. , vol.12 , Issue.4 , pp. 383-397
    • Mailharrow, D.1
  • 5
    • 34548305118 scopus 로고    scopus 로고
    • Tractable reasoning and efficient query answering in description logics: The DL-Lite family
    • DOI 10.1007/s10817-007-9078-x, Special Issue on Reasoning in Description Logics
    • D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati Tractable reasoning and efficient query answering in description logics: the DL-Lite family J. Autom. Reasoning 39 3 2007 385 429 (Pubitemid 47340922)
    • (2007) Journal of Automated Reasoning , vol.39 , Issue.3 , pp. 385-429
    • Calvanese, D.1    De Giacomo, G.2    Lembo, D.3    Lenzerini, M.4    Rosati, R.5
  • 9
    • 0019611007 scopus 로고
    • Normal form for relational databases that is based on domains and keys
    • DOI 10.1145/319587.319592
    • R. Fagin A normal form for relational databases that is based on domains and keys ACM Trans. Database Syst. 6 3 1981 387 415 (Pubitemid 12503775)
    • (1981) ACM Transactions on Database Systems , vol.6 , Issue.3 , pp. 387-415
    • Fagin, R.1
  • 11
    • 36549038135 scopus 로고    scopus 로고
    • A comparison of two modelling paradigms in the Semantic Web
    • DOI 10.1016/j.websem.2007.09.004, PII S1570826807000364, World Widw Web Conference 2006 Semantic Web Track
    • P.F. Patel-Schneider, and I. Horrocks A comparison of two modelling paradigms in the Semantic Web J. Web Sem. 5 4 2007 240 250 (Pubitemid 350186144)
    • (2007) Web Semantics , vol.5 , Issue.4 , pp. 240-250
    • Patel-Schneider, P.F.1    Horrocks, I.2
  • 12
    • 0021508773 scopus 로고
    • A proof procedure for data dependencies
    • C. Beeri, and M.Y. Vardi A proof procedure for data dependencies J. ACM 31 4 1984 718 741
    • (1984) J. ACM , vol.31 , Issue.4 , pp. 718-741
    • Beeri, C.1    Vardi, M.Y.2
  • 13
    • 84976783056 scopus 로고
    • The implication problem for data dependencies
    • C. Beeri, M.Y. Vardi, The implication problem for data dependencies, in: Proc. ICALP-1981, 1981, pp. 73-85.
    • (1981) Proc. ICALP-1981 , pp. 73-85
    • Beeri, C.1    Vardi, M.Y.2
  • 14
    • 0026204067 scopus 로고
    • Datalog extensions for database queries and updates
    • DOI 10.1016/0022-0000(91)90032-Z
    • S. Abiteboul, and V. Vianu Datalog extensions for database queries and updates J. Comput. Syst. Sci. 43 1 1991 62 124 (Pubitemid 21680395)
    • (1991) Journal of Computer and System Sciences , vol.43 , Issue.1 , pp. 62-124
    • Abiteboul Serge1    Vianu Victor2
  • 15
    • 84860514494 scopus 로고    scopus 로고
    • Taming the infinite chase: Query answering under expressive relational constraints
    • A. Calì, G. Gottlob, M. Kifer, Taming the infinite chase: query answering under expressive relational constraints, in: Proc. KR-2008, 2008, pp. 70-80, Revised version: http://dbai.tuwien.ac.at/staff/gottlob/CGK.pdf.
    • (2008) Proc. KR-2008 , pp. 70-80
    • Calì, A.1
  • 17
    • 0021375730 scopus 로고
    • Testing containment of conjunctive queries under functional and inclusion dependencies
    • DOI 10.1016/0022-0000(84)90081-3
    • D.S. Johnson, and A.C. Klug Testing containment of conjunctive queries under functional and inclusion dependencies J. Comput. Syst. Sci. 28 1 1984 167 189 (Pubitemid 14569352)
    • (1984) Journal of Computer and System Sciences , vol.28 , Issue.1 , pp. 167-189
    • Johnson, D.S.1    Klug, A.2
  • 18
    • 84880804628 scopus 로고    scopus 로고
    • Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles
    • F. Baader, Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles, in: Proc. IJCAI-2003, 2003, pp. 319-324.
    • (2003) Proc. IJCAI-2003 , pp. 319-324
    • Baader, F.1
  • 20
    • 84862006538 scopus 로고    scopus 로고
    • Data complexity in the EL family of DLs
    • A.A. Krisnadhi, C. Lutz, Data complexity in the EL family of DLs, in: Proc. DL-2007, 2007.
    • (2007) Proc. DL-2007
    • Krisnadhi, A.A.1    Lutz, C.2
  • 21
    • 1142299764 scopus 로고    scopus 로고
    • On the decidability and complexity of query answering over inconsistent and incomplete databases
    • A. Calì, D. Lembo, R. Rosati, On the decidability and complexity of query answering over inconsistent and incomplete databases, in: Proc. PODS-2003, 2003, pp. 260-271.
    • (2003) Proc. PODS-2003 , pp. 260-271
    • Calì, A.1
  • 23
    • 84958776545 scopus 로고
    • Optimal implementation of conjunctive queries in relational data bases
    • A.K. Chandra, P.M. Merlin, Optimal implementation of conjunctive queries in relational data bases, in: Proc. STOC-1977, 1977, pp. 77-90.
    • (1977) Proc. STOC-1977 , pp. 77-90
    • Chandra, A.K.1    Merlin, P.M.2
  • 25
    • 0001129020 scopus 로고    scopus 로고
    • Modal languages and bounded fragments of predicate logic
    • H. Andréka, I. Németi, and J. van Benthem Modal languages and bounded fragments of predicate logic J. Phil. Log. 27 3 1998 217 274
    • (1998) J. Phil. Log. , vol.27 , Issue.3 , pp. 217-274
    • Andréka, H.1    Németi, I.2    Van Benthem, J.3
  • 26
    • 0029204108 scopus 로고
    • On the complexity of bounded-variable queries
    • M.Y. Vardi, On the complexity of bounded-variable queries, in: Proc. PODS-1995, 1995, pp. 266-276.
    • (1995) Proc. PODS-1995 , pp. 266-276
    • Vardi, M.Y.1
  • 27
    • 0022106416 scopus 로고
    • The implication problem for functional and inclusion dependencies is undecidable
    • A.K. Chandra, and M.Y. Vardi The implication problem for functional and inclusion dependencies is undecidable SIAM J. Comput. 14 1985 671 677
    • (1985) SIAM J. Comput. , vol.14 , pp. 671-677
    • Chandra, A.K.1    Vardi, M.Y.2
  • 28
    • 33846547470 scopus 로고    scopus 로고
    • RDF vocabulary description language 1.0: RDF schema
    • 10 Feb
    • D. Brickley, R.V. Guha, RDF vocabulary description language 1.0: RDF schema, W3C recommendation, 10 Feb. 2004, http://www.w3.org/TR/rdf-schema/.
    • (2004) W3C Recommendation
    • Brickley, D.1    Guha, R.V.2
  • 29
    • 49949110731 scopus 로고    scopus 로고
    • Logical foundations of (e)RDF(S): Complexity and reasoning
    • J. de Bruijn, S. Heymans, Logical foundations of (e)RDF(S): complexity and reasoning, in: Proc. ISWC-2007, 2007, pp. 86-99.
    • (2007) Proc. ISWC-2007 , pp. 86-99
    • De Bruijn, J.1    Heymans, S.2
  • 30
    • 56649109557 scopus 로고    scopus 로고
    • Cheap Boolean role constructors for description logics
    • S. Rudolph, M. Krötzsch, P. Hitzler, Cheap Boolean role constructors for description logics, in: Proc. JELIA-2008, 2008, pp. 362-374.
    • (2008) Proc. JELIA-2008 , pp. 362-374
    • Rudolph, S.1
  • 33
    • 35348926643 scopus 로고    scopus 로고
    • Containment of conjunctive object meta-queries
    • A. Calì, M. Kifer, Containment of conjunctive object meta-queries, in: Proc. VLDB-2006, 2006, pp. 942-952.
    • (2006) Proc. VLDB-2006 , pp. 942-952
    • Calì, A.1
  • 34
    • 0029333530 scopus 로고
    • Logical foundations of object-oriented and frame-based languages
    • M. Kifer, G. Lausen, and J. Wu Logical foundations of object-oriented and frame-based languages J. ACM 42 4 1995 741 843
    • (1995) J. ACM , vol.42 , Issue.4 , pp. 741-843
    • Kifer, M.1    Lausen, G.2    Wu, J.3
  • 35
    • 70350662981 scopus 로고    scopus 로고
    • A general Datalog-based framework for tractable query answering over ontologies
    • A. Calì, G. Gottlob, T. Lukasiewicz, A general Datalog-based framework for tractable query answering over ontologies, in: Proc. PODS-2009, 2009, pp. 77-86.
    • (2009) Proc. PODS-2009 , pp. 77-86
    • Calì, A.1
  • 36
    • 0006748035 scopus 로고
    • On the declarative semantics of logic programs with negation
    • J. Minker, Morgan Kaufmann
    • V. Lifschitz On the declarative semantics of logic programs with negation J. Minker, Foundations of Deductive Databases and Logic Programming 1988 Morgan Kaufmann 177 192
    • (1988) Foundations of Deductive Databases and Logic Programming , pp. 177-192
    • Lifschitz, V.1
  • 38
    • 84863514334 scopus 로고    scopus 로고
    • OWL 2 web ontology language document overview
    • W3C 27 Oct.
    • W3C, OWL 2 web ontology language document overview, W3C recommendation, 27 Oct. 2009, http://www.w3.org/TR/owl2-overview/.
    • (2009) W3C Recommendation
  • 39
    • 4344567256 scopus 로고    scopus 로고
    • OWL web ontology language overview
    • W3C 10 Feb.
    • W3C, OWL web ontology language overview, W3C recommendation, 10 Feb. 2004, http://www.w3.org/TR/owl-features/.
    • (2004) W3C Recommendation
  • 40
    • 84880493386 scopus 로고    scopus 로고
    • Description logic programs: Combining logic programs with description logic
    • B.N. Grosof, I. Horrocks, R. Volz, S. Decker, Description logic programs: combining logic programs with description logic, in: Proc. WWW-2003, 2003, pp. 48-57.
    • (2003) Proc. WWW-2003 , pp. 48-57
    • Grosof, B.N.1    Horrocks, I.2    Volz, R.3    Decker, S.4
  • 41
    • 77954416603 scopus 로고    scopus 로고
    • OWL 2 web ontology language profiles
    • W3C 27 Oct
    • W3C, OWL 2 web ontology language profiles, W3C recommendation, 27 Oct. 2009, http://www.w3.org/TR/owl2-profiles/.
    • (2009) W3C Recommendation
  • 42
    • 57549115795 scopus 로고    scopus 로고
    • ELP: Tractable rules for OWL 2
    • M. Krötzsch, S. Rudolph, P. Hitzler, ELP: tractable rules for OWL 2, in: Proc. ISWC-2008, 2008, pp. 649-664.
    • (2008) Proc. ISWC-2008 , pp. 649-664
    • Krötzsch, M.1
  • 43
    • 84858026390 scopus 로고    scopus 로고
    • Efficient rule-based inferencing for OWL EL
    • M. Krötzsch, Efficient rule-based inferencing for OWL EL, in: Proc. IJCAI-2011, 2011, pp. 2668-2673.
    • (2011) Proc. IJCAI-2011 , pp. 2668-2673
    • Krötzsch, M.1
  • 44
    • 84873462557 scopus 로고    scopus 로고
    • A better uncle for OWL: Nominal schemas for integrating rules and ontologies
    • M. Krötzsch, F. Maier, A.A. Krisnadhi, P. Hitzler, A better uncle for OWL: nominal schemas for integrating rules and ontologies, in: Proc. WWW-2011, 2011, pp. 645-654.
    • (2011) Proc. WWW-2011 , pp. 645-654
    • Krötzsch, M.1
  • 45
    • 78650688124 scopus 로고    scopus 로고
    • Tractable query answering over conceptual schemata
    • A. Calì, G. Gottlob, A. Pieris, Tractable query answering over conceptual schemata, in: Proc. ER-2009, 2009, pp. 175-190.
    • (2009) Proc. ER-2009 , pp. 175-190
    • Calì, A.1
  • 46
    • 78649938489 scopus 로고    scopus 로고
    • Query answering under expressive entity-relationship schemata
    • A. Calì, G. Gottlob, A. Pieris, Query answering under expressive entity-relationship schemata, in: Proc. ER-10, 2010, pp. 347-361.
    • (2010) Proc. ER-10 , pp. 347-361
    • Calì, A.1
  • 47
    • 70350657109 scopus 로고    scopus 로고
    • Generalized schema-mappings: From termination to tractability
    • B. Marnette, Generalized schema-mappings: from termination to tractability, in: Proc. PODS-2009, 2009, pp. 13-22.
    • (2009) Proc. PODS-2009 , pp. 13-22
    • Marnette, B.1
  • 48
    • 0348229307 scopus 로고    scopus 로고
    • The Expressive Power of Stratified Logic Programs with Value Invention
    • L. Cabibbo The expressive power of stratified logic programs with value invention Inf. Comput. 147 1 1998 22 56 (Pubitemid 128453326)
    • (1998) Information and Computation , vol.147 , Issue.1 , pp. 22-56
    • Cabibbo, L.1
  • 51
    • 84912556883 scopus 로고    scopus 로고
    • Description logic rules
    • M. Krötzsch, S. Rudolph, P. Hitzler, Description logic rules, in: Proc. ECAI-2008, 2008, pp. 80-84.
    • (2008) Proc. ECAI-2008 , pp. 80-84
    • Krötzsch, M.1
  • 52
    • 79957830183 scopus 로고    scopus 로고
    • Advanced processing for ontological queries
    • A. Calì, G. Gottlob, A. Pieris, Advanced processing for ontological queries, in: Proc. VLDB-10, vol. 3, (1), 2010, pp. 554-565.
    • (2010) Proc. VLDB-10 , vol.3 , Issue.1 , pp. 554-565
    • Calì, A.1
  • 53
    • 78049355421 scopus 로고    scopus 로고
    • Query answering under non-guarded rules in Datalog+/
    • A. Calì, G. Gottlob, A. Pieris, Query answering under non-guarded rules in Datalog+/-, in: Proc. RR-10, 2010, pp. 1-17.
    • (2010) Proc. RR-10 , pp. 1-17
    • Calì, A.1
  • 54
    • 79955095848 scopus 로고    scopus 로고
    • On rules with existential variables: Walking the decidability line
    • J.-F. Baget, M. Leclère, M.-L. Mugnier, and E. Salvat On rules with existential variables: walking the decidability line Artif. Intell. 175 9/10 2011 1620 1654
    • (2011) Artif. Intell. , vol.175 , Issue.9-10 , pp. 1620-1654
    • Baget, J.-F.1    Leclère, M.2    Mugnier, M.-L.3    Salvat, E.4
  • 55
    • 80052730550 scopus 로고    scopus 로고
    • Ontological query answering with existential rules
    • M.-L. Mugnier, Ontological query answering with existential rules, in: Proc. RR-2011, 2011, pp. 2-23.
    • (2011) Proc. RR-2011 , pp. 2-23
    • Mugnier, M.-L.1
  • 56
    • 80052727525 scopus 로고    scopus 로고
    • Walking the complexity lines for generalized guarded existential rules
    • J.-F. Baget, M.-L. Mugnier, S. Rudolph, M. Thomazo, Walking the complexity lines for generalized guarded existential rules, in: Proc. IJCAI-2011, 2011, pp. 712-717.
    • (2011) Proc. IJCAI-2011 , pp. 712-717
    • Baget, J.-F.1    Mugnier, M.-L.2    Rudolph, S.3    Thomazo, M.4
  • 57
    • 76249092810 scopus 로고    scopus 로고
    • FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols
    • Article 14
    • T. Eiter, and M. Šimkus FDNC: decidable nonmonotonic disjunctive logic programs with function symbols ACM Trans. Comput. Log. 11 2 2010 Article 14
    • (2010) ACM Trans. Comput. Log. , vol.11 , Issue.2
    • Eiter, T.1    Šimkus, M.2
  • 59
    • 84880843747 scopus 로고    scopus 로고
    • Query rewriting and answering under constraints in data integration systems
    • A. Calì, D. Lembo, R. Rosati, Query rewriting and answering under constraints in data integration systems, in: Proc. IJCAI-2003, 2003, pp. 16-21.
    • (2003) Proc. IJCAI-2003 , pp. 16-21
    • Calì, A.1
  • 60
    • 79957828081 scopus 로고    scopus 로고
    • Ontological queries: Rewriting and optimization
    • G. Gottlob, G. Orsi, A. Pieris, Ontological queries: rewriting and optimization, in: Proc. ICDE-2011, 2011, pp. 2-13.
    • (2011) Proc. ICDE-2011 , pp. 2-13
    • Gottlob, G.1    Orsi, G.2    Pieris, A.3
  • 61
    • 77549087969 scopus 로고    scopus 로고
    • Tractable query answering and rewriting under description logic constraints
    • H. Pérez-Urbina, B. Motik, and I. Horrocks Tractable query answering and rewriting under description logic constraints J. Appl. Log. 8 2 2010 186 209
    • (2010) J. Appl. Log. , vol.8 , Issue.2 , pp. 186-209
    • Pérez-Urbina, H.1    Motik, B.2    Horrocks, I.3
  • 62
    • 56649086453 scopus 로고    scopus 로고
    • On conjunctive query answering in EL
    • R. Rosati, On conjunctive query answering in EL, in: Proc. DL-2007, 2007.
    • (2007) Proc. DL-2007
    • Rosati, R.1
  • 63
    • 49949104444 scopus 로고    scopus 로고
    • Conjunctive queries for a tractable fragment of OWL 1.1
    • M. Krötzsch, S. Rudolph, P. Hitzler, Conjunctive queries for a tractable fragment of OWL 1.1, in: Proc. ISWC/ASWC-2007, 2007, pp. 310-323.
    • (2007) Proc. ISWC/ASWC-2007 , pp. 310-323
    • Krötzsch, M.1
  • 64
    • 78751689814 scopus 로고    scopus 로고
    • Conjunctive query answering in the description logic EL using a relational database system
    • C. Lutz, D. Toman, F. Wolter, Conjunctive query answering in the description logic EL using a relational database system, in: Proc. IJCAI-2009, 2009, pp. 2070-2075.
    • (2009) Proc. IJCAI-2009 , pp. 2070-2075
    • Lutz, C.1    Toman, D.2    Wolter, F.3
  • 67
    • 84885910857 scopus 로고    scopus 로고
    • Improving query answering over DL-Lite ontologies
    • R. Rosati, A. Almatelli, Improving query answering over DL-Lite ontologies, in: Proc KR-2010, 2010.
    • (2010) Proc KR-2010
    • Rosati, R.1    Almatelli, A.2
  • 68
    • 80053058060 scopus 로고    scopus 로고
    • Optimizing query answering under ontological constraints
    • G. Orsi, and A. Pieris Optimizing query answering under ontological constraints PVLDB 4 11 2011 1004 1015
    • (2011) PVLDB , vol.4 , Issue.11 , pp. 1004-1015
    • Orsi, G.1    Pieris, A.2
  • 69
    • 80053074141 scopus 로고    scopus 로고
    • Rewriting ontological queries into small nonrecursive Datalog programs
    • CoRR, abs/1106.3767, 2011, Revised version, in: Proc. KR-2012, 2012
    • G. Gottlob, T. Schwentick, Rewriting ontological queries into small nonrecursive Datalog programs, in: Proc. DL-2011, 2011, See also: CoRR, abs/1106.3767, 2011, Revised version, in: Proc. KR-2012, 2012.
    • (2011) Proc. DL-2011
    • Gottlob, G.1    Schwentick, T.2
  • 70
    • 80053070411 scopus 로고    scopus 로고
    • Ontological query answering via rewriting
    • G. Gottlob, G. Orsi, A. Pieris, Ontological query answering via rewriting, in: Proc. ADBIS-2011, 2011, pp. 1-18.
    • (2011) Proc. ADBIS-2011 , pp. 1-18
    • Gottlob, G.1    Orsi, G.2    Pieris, A.3
  • 71
    • 84880721144 scopus 로고    scopus 로고
    • A uniform integration of higher-order reasoning and external evaluations in answer-set programming
    • T. Eiter, G. Ianni, R. Schindlauer, H. Tompits, A uniform integration of higher-order reasoning and external evaluations in answer-set programming, in: Proc. IJCAI-2005, 2005, pp. 90-96.
    • (2005) Proc. IJCAI-2005 , pp. 90-96
    • Eiter, T.1    Ianni, G.2    Schindlauer, R.3    Tompits, H.4
  • 73
    • 46549089044 scopus 로고    scopus 로고
    • Combining answer set programming with description logics for the Semantic Web
    • T. Eiter, G. Ianni, T. Lukasiewicz, R. Schindlauer, and H. Tompits Combining answer set programming with description logics for the Semantic Web Artif. Intell. 172 12/13 2008 1495 1539
    • (2008) Artif. Intell. , vol.172 , Issue.12-13 , pp. 1495-1539
    • Eiter, T.1    Ianni, G.2    Lukasiewicz, T.3    Schindlauer, R.4    Tompits, H.5
  • 74
    • 79551655153 scopus 로고    scopus 로고
    • Well-founded semantics for description logic programs in the Semantic Web
    • Article 11
    • T. Eiter, G. Ianni, T. Lukasiewicz, and R. Schindlauer Well-founded semantics for description logic programs in the Semantic Web ACM Trans. Comput. Log. 12 2 2011 Article 11
    • (2011) ACM Trans. Comput. Log. , vol.12 , Issue.2
    • Eiter, T.1    Ianni, G.2    Lukasiewicz, T.3    Schindlauer, R.4
  • 75
    • 34249939910 scopus 로고    scopus 로고
    • Probabilistic description logic programs
    • DOI 10.1016/j.ijar.2006.06.012, PII S0888613X06000648, Eighth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2005)
    • T. Lukasiewicz Probabilistic description logic programs Int. J. Approx. Reas. 45 2 2007 288 307 (Pubitemid 46880199)
    • (2007) International Journal of Approximate Reasoning , vol.45 , Issue.2 , pp. 288-307
    • Lukasiewicz, T.1
  • 76
    • 46549084285 scopus 로고    scopus 로고
    • Fuzzy description logic programs under the answer set semantics for the Semantic Web
    • T. Lukasiewicz Fuzzy description logic programs under the answer set semantics for the Semantic Web Fundam. Inform. 82 3 2008 289 310
    • (2008) Fundam. Inform. , vol.82 , Issue.3 , pp. 289-310
    • Lukasiewicz, T.1
  • 79
    • 84866249230 scopus 로고    scopus 로고
    • Non-monotonic rule systems on top of ontology layers
    • G. Antoniou, Non-monotonic rule systems on top of ontology layers, in: Proc. ISWC-2002, 2002, pp. 394-398.
    • (2002) Proc. ISWC-2002 , pp. 394-398
    • Antoniou, G.1
  • 80
    • 84866254671 scopus 로고    scopus 로고
    • TRIPLE - A query, inference, and transformation language for the Semantic Web
    • M. Sintek, S. Decker, TRIPLE - a query, inference, and transformation language for the Semantic Web, in: Proc. ISWC-2002, 2002, pp. 364-378.
    • (2002) Proc. ISWC-2002 , pp. 364-378
    • Sintek, M.1    Decker, S.2
  • 81
    • 21244467061 scopus 로고    scopus 로고
    • OWL rules: A proposal and prototype implementation
    • DOI 10.1016/j.websem.2005.05.003, PII S1570826805000053, Rules Systems
    • I. Horrocks, P.F. Patel-Schneider, S. Bechhofer, and D. Tsarkov OWL rules: a proposal and prototype implementation J. Web Sem. 3 1 2005 23 40 (Pubitemid 40891657)
    • (2005) Web Semantics , vol.3 , Issue.1 , pp. 23-40
    • Horrocks, I.1    Patel-Schneider, P.F.2    Bechhofer, S.3    Tsarkov, D.4
  • 83
    • 0032156942 scopus 로고    scopus 로고
    • Combining Horn rules and description logics in CARIN
    • PII S0004370298000484
    • A.Y. Levy, and M.-C. Rousset Combining Horn rules and description logics in CARIN Artif. Intell. 104 1/2 1998 165 209 (Pubitemid 128400989)
    • (1998) Artificial Intelligence , vol.104 , Issue.1-2 , pp. 165-209
    • Levy, A.Y.1    Rousset, M.-C.2
  • 84
    • 0003333139 scopus 로고    scopus 로고
    • Towards expressive KR systems integrating Datalog and description logics: Preliminary report
    • R. Rosati, Towards expressive KR systems integrating Datalog and description logics: preliminary report, in: Proc. DL-1999, 1999.
    • (1999) Proc. DL-1999
    • Rosati, R.1
  • 85
    • 21244492715 scopus 로고    scopus 로고
    • On the decidability and complexity of integrating ontologies and rules
    • DOI 10.1016/j.websem.2005.05.002, PII S1570826805000041, Rules Systems
    • R. Rosati On the decidability and complexity of integrating ontologies and rules J. Web Sem. 3 1 2005 61 73 (Pubitemid 40891659)
    • (2005) Web Semantics , vol.3 , Issue.1 , pp. 61-73
    • Rosati, R.1
  • 86
    • 21244502056 scopus 로고    scopus 로고
    • Query answering for OWL-DL with rules
    • DOI 10.1016/j.websem.2005.05.001, PII S157082680500003X, Rules Systems
    • B. Motik, U. Sattler, and R. Studer Query answering for OWL-DL with rules J. Web Sem. 3 1 2005 41 60 (Pubitemid 40891658)
    • (2005) Web Semantics , vol.3 , Issue.1 , pp. 41-60
    • Motik, B.1    Sattler, U.2    Studer, R.3
  • 87
    • 84860600786 scopus 로고    scopus 로고
    • DL + log: Tight integration of description logics and disjunctive Datalog
    • R. Rosati, DL + log: tight integration of description logics and disjunctive Datalog, in: Proc. KR-2006, 2006, pp. 68-78.
    • (2006) Proc. KR-2006 , pp. 68-78
    • Rosati, R.1
  • 88
    • 84880854013 scopus 로고    scopus 로고
    • A faithful integration of description logics with logic programming
    • B. Motik, R. Rosati, A faithful integration of description logics with logic programming, in: Proc. IJCAI-2007, 2007, pp. 477-482.
    • (2007) Proc. IJCAI-2007 , pp. 477-482
    • Motik, B.1    Rosati, R.2
  • 89
    • 0043159198 scopus 로고
    • Non-monotonic databases and epistemic queries
    • V. Lifschitz, Non-monotonic databases and epistemic queries, in: Proc. IJCAI-1991, 1991, pp. 381-386.
    • (1991) Proc. IJCAI-1991 , pp. 381-386
    • Lifschitz, V.1
  • 90
    • 77956992349 scopus 로고    scopus 로고
    • A novel combination of answer set programming with description logics for the Semantic Web
    • T. Lukasiewicz A novel combination of answer set programming with description logics for the Semantic Web IEEE Trans. Knowl. Data Eng. 22 11 2010 1577 1592
    • (2010) IEEE Trans. Knowl. Data Eng. , vol.22 , Issue.11 , pp. 1577-1592
    • Lukasiewicz, T.1
  • 91
    • 84880863877 scopus 로고    scopus 로고
    • Embedding non-ground logic programs into autoepistemic logic for knowledge base combination
    • J.D. Bruijn, T. Eiter, A. Polleres, H. Tompits, Embedding non-ground logic programs into autoepistemic logic for knowledge base combination, in: Proc. IJCAI-2007, 2007, pp. 304-309.
    • (2007) Proc. IJCAI-2007 , pp. 304-309
    • Bruijn, J.D.1    Eiter, T.2    Polleres, A.3    Tompits, H.4
  • 92
    • 33749547173 scopus 로고    scopus 로고
    • CEL - A polynomial-time reasoner for life science ontologies
    • 2006
    • F. Baader, C. Lutz, B. Suntisrivaraporn, CEL - a polynomial-time reasoner for life science ontologies, in: Proc. IJCAR-2006, 2006, pp. 287-291.
    • Proc. IJCAR-2006 , pp. 287-291
    • Baader, F.1    Lutz, C.2    Suntisrivaraporn, B.3
  • 94
    • 84862015109 scopus 로고    scopus 로고
    • Fast classification in Protégé: Snorocket as an OWL2 EL reasoner
    • M.J. Lawley, C. Bousquet, Fast classification in Protégé: Snorocket as an OWL2 EL reasoner, in: Proc. DL-2010, 2010.
    • (2010) Proc. DL-2010
    • Lawley, M.J.1    Bousquet, C.2
  • 96
    • 83055179388 scopus 로고    scopus 로고
    • Semantic data markets: A flexible environment for knowledge management
    • R. de Virgilio, G. Orsi, L. Tanca, R. Torlone, Semantic data markets: a flexible environment for knowledge management, in: Proc. CIKM-2011, 2011, pp. 1559-1564.
    • (2011) Proc. CIKM-2011 , pp. 1559-1564
    • De Virgilio, R.1    Orsi, G.2    Tanca, L.3    Torlone, R.4
  • 101
    • 33645468330 scopus 로고    scopus 로고
    • Racer: An OWL reasoning agent for the Semantic Web
    • V. Haarslev, R. Möller, Racer: an OWL reasoning agent for the Semantic Web, in: Proc. Web Intelligence Workshops-2003, 2003, pp. 91-95.
    • (2003) Proc. Web Intelligence Workshops-2003 , pp. 91-95
    • Haarslev, V.1
  • 102
    • 34250652540 scopus 로고    scopus 로고
    • On the decidability and finite controllability of query processing in databases with incomplete information
    • DOI 10.1145/1142351.1142404, Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2006
    • R. Rosati, On the decidability and finite controllability of query processing in databases with incomplete information, in: Proc. PODS-2006, 2006, pp. 356-365. (Pubitemid 46946498)
    • (2006) Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems , pp. 356-365
    • Rosati, R.1
  • 103
    • 78449283182 scopus 로고    scopus 로고
    • Querying the guarded fragment
    • Full paper available from the authors
    • V. Barany, G. Gottlob, M. Otto, Querying the guarded fragment, in: Proc. LICS-10, 2010, pp. 1-10. Full paper available from the authors.
    • (2010) Proc. LICS-10 , pp. 1-10
    • Barany, V.1    Gottlob, G.2    Otto, M.3
  • 104
    • 57349165912 scopus 로고    scopus 로고
    • The expressive power of SPARQL
    • R. Angles, C. Gutierrez, The expressive power of SPARQL, in: Proc. ISWC-2008, 2008, pp. 114-129.
    • (2008) Proc. ISWC-2008 , pp. 114-129
    • Angles, R.1    Gutierrez, C.2
  • 105
    • 0038062314 scopus 로고    scopus 로고
    • Complexity and expressive power of logic programming
    • E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov Complexity and expressive power of logic programming ACM Comput. Surv. 33 3 2001 374 425 (Pubitemid 33768487)
    • (2001) ACM Computing Surveys , vol.33 , Issue.3 , pp. 374-425
    • Dantsin, E.1    Eiter, T.2    Gottlob, G.3    Voronkov, A.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.