메뉴 건너뛰기




Volumn 2015-January, Issue , 2015, Pages 3106-3112

Query rewriting for existential rules with compiled preorder

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DATA DESCRIPTION;

EID: 84949921866     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (13)

References (32)
  • 1
    • 84880849114 scopus 로고    scopus 로고
    • Terminological cycles in a description logic with existential restrictions
    • F. Baader. Terminological Cycles in a Description Logic with Existential Restrictions. In IJCAI'03, pages 325-330, 2003.
    • (2003) IJCAI'03 , pp. 325-330
    • Baader, F.1
  • 2
    • 78751687512 scopus 로고    scopus 로고
    • Extending decidable cases for rules with existential variables
    • J.-F. Baget, M. Leclère, M.-L. Mugnier, and E. Salvat. Extending Decidable Cases for Rules with Existential Variables. In IJCAI'09, pages 677-682, 2009.
    • (2009) IJCAI'09 , pp. 677-682
    • Baget, J.-F.1    Leclère, M.2    Mugnier, M.-L.3    Salvat, E.4
  • 3
    • 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. Artificial Intelligence, 175(9-10):1620-1654, 2011.
    • (2011) Artificial Intelligence , vol.175 , Issue.9-10 , pp. 1620-1654
    • Baget, J.-F.1    Leclère, M.2    Mugnier, M.-L.3    Salvat, E.4
  • 4
    • 84976783056 scopus 로고
    • The implication problem for data dependencies
    • C. Beeri and M. Vardi. The implication problem for data dependencies. In ICALP'81, volume 115 of LNCS, pages 73-85, 1981.
    • (1981) ICALP'81, Volume 115 of LNCS , pp. 73-85
    • Beeri, C.1    Vardi, M.2
  • 5
    • 84860514494 scopus 로고    scopus 로고
    • Taming the infinite chase: Query answering under expressive relational constraints
    • A. Calì, G. Gottlob, and M. Kifer. Taming the Infinite Chase: Query Answering under Expressive Relational Constraints. In KR'08, pages 70-80, 2008.
    • (2008) KR'08 , pp. 70-80
    • Calì, A.1    Gottlob, G.2    Kifer, M.3
  • 6
    • 70350662981 scopus 로고    scopus 로고
    • A general datalog-based framework for tractable query answering over ontologies
    • A. Calì, G. Gottlob, and T. Lukasiewicz. A General Datalog-Based Framework for Tractable Query Answering over Ontologies. In PODS'09, pages 77-86, 2009.
    • (2009) PODS'09 , pp. 77-86
    • Calì, A.1    Gottlob, G.2    Lukasiewicz, T.3
  • 7
    • 84869118273 scopus 로고    scopus 로고
    • Towards more expressive ontology languages: The query answering problem
    • A. Calì, G. Gottlob, and A. Pieris. Towards more expressive ontology languages: The query answering problem. Artif. Intell., 193:87-128, 2012.
    • (2012) Artif. Intell. , vol.193 , pp. 87-128
    • Calì, A.1    Gottlob, G.2    Pieris, A.3
  • 9
    • 80051700588 scopus 로고    scopus 로고
    • Optimized query rewriting for OWL 2 QL
    • Alexandros Chortaras, Despoina Trivela, and Giorgos B. Stamou. Optimized Query Rewriting for OWL 2 QL. In CADE'11, pages 192-206, 2011.
    • (2011) CADE'11 , pp. 192-206
    • Chortaras, A.1    Trivela, D.2    Stamou, G.B.3
  • 10
    • 84867132783 scopus 로고    scopus 로고
    • A broad class of first-order rewritable tuple-generating dependencies
    • C. Civili and R. Rosati. A Broad Class of First-Order Rewritable Tuple-Generating Dependencies. In Datalog 2.0 Worksop, pages 68-80, 2012.
    • (2012) Datalog 2.0 Worksop , pp. 68-80
    • Civili, C.1    Rosati, R.2
  • 13
    • 84893348866 scopus 로고    scopus 로고
    • Rewriting ontological queries into small nonrecursive datalog programs
    • G. Gottlob and T. Schwentick. Rewriting Ontological Queries into Small Nonrecursive Datalog Programs. In KR, 2012.
    • (2012) KR
    • Gottlob, G.1    Schwentick, T.2
  • 14
    • 79957828081 scopus 로고    scopus 로고
    • Ontological queries: Rewriting and optimization
    • G. Gottlob, G. Orsi, and A. Pieris. Ontological queries: Rewriting and Optimization. In ICDE'11, pages 2-13, 2011.
    • (2011) ICDE'11 , pp. 2-13
    • Gottlob, G.1    Orsi, G.2    Pieris, A.3
  • 15
    • 85167422956 scopus 로고    scopus 로고
    • Benchmarking ontology-based query rewriting systems
    • M. Imprialou, G. Stoilos, and B. Cuenca Grau. Benchmarking Ontology-Based Query Rewriting Systems. In AAAI, 2012.
    • (2012) AAAI
    • Imprialou, M.1    Stoilos, G.2    Cuenca Grau, B.3
  • 16
    • 84949870164 scopus 로고    scopus 로고
    • Polynomial conjunctive query rewriting under unary inclusion dependencies
    • S. Kikot, R. Kontchakov, and M. Zakharyaschev. Polynomial Conjunctive Query Rewriting under Unary Inclusion Dependencies. In RR, 2011.
    • (2011) RR
    • Kikot, S.1    Kontchakov, R.2    Zakharyaschev, M.3
  • 18
    • 85006841280 scopus 로고    scopus 로고
    • A sound and complete backward chaining algorithm for existential rules
    • M. König, M. Leclère, M.-L. Mugnier, and M. Thomazo. A Sound and Complete Backward Chaining Algorithm for Existential Rules. In RR'12, pages 122-138, 2012.
    • (2012) RR'12 , pp. 122-138
    • König, M.1    Leclère, M.2    Mugnier, M.-L.3    Thomazo, M.4
  • 19
    • 84881124461 scopus 로고    scopus 로고
    • On the exploration of the query rewriting space with existential rules
    • M. König, M. Leclère, M.-L. Mugnier, and M. Thomazo. On the Exploration of the Query Rewriting Space with Existential Rules. In RR, pages 123-137, 2013.
    • (2013) RR , pp. 123-137
    • König, M.1    Leclère, M.2    Mugnier, M.-L.3    Thomazo, M.4
  • 21
    • 84859119967 scopus 로고    scopus 로고
    • Extending decidable existential rules by joining acyclicity and guardedness
    • M. Krötzsch and S. Rudolph. Extending Decidable Existential Rules by Joining Acyclicity and Guardedness. In IJCAI'11, pages 963-968, 2011.
    • (2011) IJCAI'11 , pp. 963-968
    • Krötzsch, M.1    Rudolph, S.2
  • 22
    • 84891952522 scopus 로고    scopus 로고
    • The combined approach to OBDA: Taming role hierarchies using filters
    • C. Lutz, I. Seylan, D. Toman, and F. Wolter. The Combined Approach to OBDA: Taming Role Hierarchies Using Filters. In ISWC'2013, pages 314-330, 2013.
    • (2013) ISWC'2013 , pp. 314-330
    • Lutz, C.1    Seylan, I.2    Toman, D.3    Wolter, F.4
  • 23
    • 78650447140 scopus 로고    scopus 로고
    • Efficient query answering for OWL 2
    • H. Pérez-Urbina, I. Horrocks, and B. Motik. Efficient Query Answering for OWL 2. In ISWC'09, pages 489-504, 2009.
    • (2009) ISWC'09 , pp. 489-504
    • Pérez-Urbina, H.1    Horrocks, I.2    Motik, B.3
  • 24
    • 84893393225 scopus 로고    scopus 로고
    • High performance query answering over DL-lite ontologies
    • M. Rodriguez-Muro and D. Calvanese. High Performance Query Answering over DL-Lite Ontologies. In KR, 2012.
    • (2012) KR
    • Rodriguez-Muro, M.1    Calvanese, D.2
  • 26
    • 80051679347 scopus 로고    scopus 로고
    • Improving query answering over DL-lite ontologies
    • R. Rosati and A. Almatelli. Improving Query Answering over DL-Lite Ontologies. In KR'10, 2010.
    • (2010) KR'10
    • Rosati, R.1    Almatelli, A.2
  • 27
    • 84896061543 scopus 로고    scopus 로고
    • Small datalog query rewritings for EL
    • G. Stefanoni, B. Motik, and I. Horrocks. Small Datalog Query Rewritings for EL. In DL, 2012.
    • (2012) DL
    • Stefanoni, G.1    Motik, B.2    Horrocks, I.3
  • 28
    • 84923118688 scopus 로고    scopus 로고
    • Mixing materialization and query rewriting for existential rules
    • M. Thomazo and S. Rudolph. Mixing Materialization and Query Rewriting for Existential Rules. In ECAI, pages 897-902, 2014.
    • (2014) ECAI , pp. 897-902
    • Thomazo, M.1    Rudolph, S.2
  • 29
    • 84893390254 scopus 로고    scopus 로고
    • A generic querying algorithm for greedy sets of existential rules
    • M. Thomazo, J.-F. Baget, M.-L. Mugnier, and S. Rudolph. A Generic Querying Algorithm for Greedy Sets of Existential Rules. In KR, 2012.
    • (2012) KR
    • Thomazo, M.1    Baget, J.-F.2    Mugnier, M.-L.3    Rudolph, S.4
  • 30
    • 84896061959 scopus 로고    scopus 로고
    • Compact rewritings for existential rules
    • M. Thomazo. Compact Rewritings for Existential Rules. In IJCAI, 2013.
    • (2013) IJCAI
    • Thomazo, M.1
  • 31
    • 84892420165 scopus 로고    scopus 로고
    • Optimising resolution-based rewriting algorithms for DL ontologies
    • Despoina Trivela, Giorgos Stoilos, Alexandros Chortaras, and Giorgos B. Stamou. Optimising Resolution-Based Rewriting Algorithms for DL Ontologies. In DL'13, pages 464-476, 2013.
    • (2013) DL'13 , pp. 464-476
    • Trivela, D.1    Stoilos, G.2    Chortaras, A.3    Stamou, G.B.4
  • 32
    • 84864193988 scopus 로고    scopus 로고
    • NYAYA: A system supporting the uniform management of large sets of semantic data
    • Roberto De Virgilio, G. Orsi, L. Tanca, and R. Torlone. NYAYA: A System Supporting the Uniform Management of Large Sets of Semantic Data. In ICDE, pages 1309-1312, 2012.
    • (2012) ICDE , pp. 1309-1312
    • De Virgilio, R.1    Orsi, G.2    Tanca, L.3    Torlone, R.4


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