Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Calí, G. Gottlob, Thomas Lukasiewicz (2009)
A general datalog-based framework for tractable query answering over ontologies
G. Gottlob, André Hernich, C. Kupke, Thomas Lukasiewicz (2014)
Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and ComplexityJournal of the ACM (JACM), 68
Alin Deutsch, Alan Nash, J. Remmel (2008)
The chase revisited
S. Brandt (2004)
Polynomial Time Reasoning in a Description Logic with Existential Restrictions, GCI Axioms, and - What Else?
Ton Kloks (1994)
Treewidth, Computations and Approximations, Lecture Notes in Computer Science, Vol
A. Calí, G. Gottlob, Thomas Lukasiewicz (2012)
A General Datalog-Based Framework for Tractable Query Answering over Ontologies (extended abstract)J. Web Semant., 14
Andrea Calì, Georg Gottlob, Thomas Lukasiewicz (2009)
Tractable query answering over ontologies with Datalog+/-Proceedings of DL Workshop 2009
V. Bárány, G. Gottlob, M. Otto (2010)
Querying the Guarded Fragment2010 25th Annual IEEE Symposium on Logic in Computer Science
Riccardo Rosati (2007)
On conjunctive query answering in ELProceedings of DL Workshop’07
A. Calí, G. Gottlob, Andreas Pieris (2010)
Query Answering under Non-guarded Rules in Datalog+/-
Diego Calvanese, Giuseppe Giacomo, D. Lembo, M. Lenzerini, R. Rosati (2007)
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite FamilyJournal of Automated Reasoning, 39
Mario Alviano, Wolfgang Faber, N. Leone, M. Manna (2012)
Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issuesTheory and Practice of Logic Programming, 12
Héctor Pérez-Urbina, Ian Horrocks, B. Motik (2009)
Efficient Query Answering for OWL 2
Cristina Civili, R. Rosati (2012)
A Broad Class of First-Order Rewritable Tuple-Generating Dependencies
B. Grau, Ian Horrocks, M. Krötzsch, C. Kupke, Despoina Magka, B. Motik, Zhe Wang (2013)
Acyclicity Notions for Existential Rules and Their Application to Query Answering in OntologiesJ. Artif. Intell. Res., 47
Yujiao Zhou, Bernardo Cuenca Grau, Yavor Nenov, Mark Kaminski, Ian Horrocks (2015)
PAGOdA: Pay-as-you-go ontology query answering using a Datalog reasonerJournal of Artificial Intelligence Research 54 (2015), 54
Mario Alviano, Michael Morak, Andreas Pieris (2017)
Stable Model Semantics for Tuple-Generating Dependencies RevisitedProceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
N. Leone, G. Pfeifer, Wolfgang Faber, Thomas Eiter, G. Gottlob, S. Perri, Francesco Scarcello (2002)
The DLV system for knowledge representation and reasoningACM Trans. Comput. Log., 7
R. Rosati (2007)
On Conjunctive Query Answering in ELDescription Logics
Andrea Acciarri, Diego Calvanese, Giuseppe Giacomo, D. Lembo, M. Lenzerini, Mattia Palmieri, R. Rosati (2005)
QuOnto: Querying Ontologies
J. Urbani, M. Krötzsch, C. Jacobs, Irina Dragoste, David Carral (2018)
Efficient Model Construction for Horn Logic with VLog - System Description
Meghyn Bienvenu, B. Cate, Carsten Lutz, Frank Wolter (2014)
Ontology-Based Data AccessACM Transactions on Database Systems (TODS), 39
P. Bourhis, M. Manna, Michael Morak, Andreas Pieris (2016)
Guarded-Based Disjunctive Tuple-Generating DependenciesACM Transactions on Database Systems (TODS), 41
Yujiao Zhou, Yavor Nenov, B. Grau, Ian Horrocks (2015)
Pay-as-you-go Ontology Query Answering Using a Datalog Reasoner
Despoina Trivela, G. Stoilos, A. Chortaras, G. Stamou (2015)
Optimising resolution-based rewriting algorithms for OWL ontologiesJ. Web Semant., 33
Georg Gottlob, Marco Manna, Andreas Pieris (2013)
Combining decidability paradigms for existential rulesTheory and Practice of Logic Programming, 13
Bernardo Cuenca Grau, Boris Motik, Giorgos Stoilos, Ian Horrocks (2012)
Completeness guarantees for incomplete ontologyreasoners: Theory and practice. Journal of Artificial Intelligence Research 43 (2012), 43
D. Tsarkov, Ian Horrocks (2006)
FaCT++ Description Logic Reasoner: System Description
Georg Gottlob, André Hernich, Clemens Kupke, Thomas Lukasiewicz (2014)
Stable model semantics for guarded existential rules and description logicsProceedings of KR’14
Francesco Calimeri, Susanna Cozza, Giovambattista Ianni, N. Leone (2010)
Enhancing ASP by Functions: Decidable Classes and Implementation TechniquesProceedings of the AAAI Conference on Artificial Intelligence
B. Motik, Rob Shearer, Ian Horrocks (2009)
Hypertableau Reasoning for Description LogicsArXiv, abs/1401.3485
A. Calí, G. Gottlob, Andreas Pieris (2010)
Advanced processing for ontological queriesProceedings of the VLDB Endowment, 3
T. Kloks (1994)
Treewidth, 842
M. Krötzsch, S. Rudolph (2011)
Extending Decidable Existential Rules by Joining Acyclicity and Guardedness
N. Leone, M. Manna, G. Terracina, P. Veltri (2012)
Efficiently Computable Datalog∃ Programs
Sebastian Rudolph, Markus Krötzsch, Pascal Hitzler (2008)
All Elephants are bigger than all miceProceedings of DL Workshop’08
F. Baader, S. Brandt, C. Lutz (2005)
Pushing the EL Envelope
A. Chortaras, Despoina Trivela, G. Stamou (2011)
Optimized Query Rewriting for OWL 2 QL
Jean-François Baget, M. Leclère, M. Mugnier, Swan Rocher, Clément Sipieter (2015)
Graal: A Toolkit for Query Answering with Existential Rules
P. Bourhis, Michael Morak, Andreas Pieris (2017)
Making Cross Products and Guarded Ontology Languages Compatible
A. Calí, G. Gottlob, Andreas Pieris (2012)
Towards more expressive ontology languages: The query answering problemArtif. Intell., 193
Yuanbo Guo, Zhengxiang Pan, J. Heflin (2005)
LUBM: A benchmark for OWL knowledge base systemsJ. Web Semant., 3
M. König, M. Leclère, M. Mugnier (2015)
Query Rewriting for Existential Rules with Compiled Preorder
Tomasz Gogacz, J. Marcinkowski (2012)
Converging to the Chase -- A Tool for Finite Controllability2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
S. Greco, Francesca Spezzano, I. Trubitsyna (2011)
Stratification criteria and rewriting techniques for checking chase terminationProceedings of the VLDB Endowment, 4
Thomas Eiter, Magdalena Ortiz, M. Simkus, T. Tran, Guohui Xiao (2012)
Query Rewriting for Horn-SHIQ Plus Rules
David Johnson, Anthony Klug (1982)
Testing containment of conjunctive queries under functional and inclusion dependenciesProceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov (2001)
Complexity and expressive power of logic programmingACM Computing Surveys 33 (2001), 33
C. Cumbo, Wolfgang Faber, G. Greco, N. Leone (2004)
Enhancing the Magic-Set Method for Disjunctive Datalog Programs
Jean-François Baget, M. Leclère, M. Mugnier (2010)
Walking the Decidability Line for Rules with Existential Variables
C. Lutz, Inanç Seylan, David Toman, F. Wolter (2013)
The Combined Approach to OBDA: Taming Role Hierarchies using Filters
David S. Johnson, Anthony C. Klug (1984)
Testing containment of conjunctive queries under functional and inclusion dependenciesJournal of Computer and System Sciences, 28
Mariano Rodriguez-Muro, Diego Calvanese (2011)
Dependencies: Making ontology based data access work in practiceProceedings of AMW’11
Héctor Pérez-Urbina, B. Motik, Ian Horrocks (2010)
Tractable query answering and rewriting under description logic constraintsJ. Appl. Log., 8
M. Mugnier (2011)
Ontological Query Answering with Existential Rules
Sebastian Brandt (2004)
Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and - what else? In Proceedings of PAIS’04IOS Press
Vince Bárány, Georg Gottlob, Martin Otto (2014)
Querying the guarded fragmentLogical Methods in Computer Science, 10
Diego Calvanese, B. Cogrel, Sarah Komla-Ebri, R. Kontchakov, D. Lanti, Martín Rezk, M. Rodriguez-Muro, Guohui Xiao (2016)
Ontop: Answering SPARQL queries over relational databasesSemantic Web, 8
Jean-François Baget, M. Leclère, M. Mugnier, E. Salvat (2009)
Extending Decidable Cases for Rules with Existential Variables
Mariano Rodriguez-Muro, Diego Calvanese (2011)
Dependencies to optimize ontology based data accessProceedings of DL Workshop’11
A. Calí, G. Gottlob, M. Kifer (2008)
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Bruno Marnette (2009)
Generalized schema-mappings: from termination to tractability
M. Meier, Michael Schmidt, G. Lausen (2009)
On Chase Termination Beyond StratificationProc. VLDB Endow., 2
E. Dantsin, Thomas Eiter, G. Gottlob, A. Voronkov (1997)
Complexity and expressive power of logic programmingProceedings of Computational Complexity. Twelfth Annual IEEE Conference
V. Haarslev, Ralf Möller (2001)
RACER System Description
A. Artale, Diego Calvanese, R. Kontchakov, M. Zakharyaschev (2009)
The DL-Lite Family and RelationsArXiv, abs/1401.3487
Michael Benedikt, G. Konstantinidis, G. Mecca, B. Motik, Paolo Papotti, Donatello Santoro, Efthymia Tsamoura (2017)
Benchmarking the ChaseProceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
G. Gottlob (2009)
Datalog±: a unified approach to ontologies and integrity constraints
Nicola Leone, Marco Manna, Giorgio Terracina, Pierfrancesco Veltri (2012)
Efficiently computable Datalog∃ programsProceedings of KR’12. AAAI Press
Onofrio Febbraro, N. Leone, F. Ricca, G. Terracina, P. Veltri (2013)
A graphic tool for ontology reasoning under Datalog∃
Luigi Bellomarini, Emanuel Sallinger, G. Gottlob (2018)
The Vadalog System: Datalog-based Reasoning for Knowledge GraphsArXiv, abs/1807.08709
G. Gottlob, Andreas Pieris, Lidia Tendera (2013)
Querying the Guarded Fragment with Transitivity
Jean-François Baget, M. Leclère, M. Mugnier, E. Salvat (2011)
On rules with existential variables: Walking the decidability lineArtif. Intell., 175
G. Gottlob, S. Kikot, R. Kontchakov, V. Podolskii, T. Schwentick, M. Zakharyaschev (2014)
The price of query rewriting in ontology-based data accessArtif. Intell., 213
S. Abiteboul, R. Hull, V. Vianu (1995)
Foundations of Databases: The Logical Level
G. Gottlob, M. Manna, Andreas Pieris (2015)
Combining decidability paradigms for existential rules. Theory and Practice of Logic Programming - CORRIGENDUMTheory and Practice of Logic Programming, 16
G. Gottlob, M. Manna, Andreas Pieris (2013)
Theory and Practice of Logic Programming
Francesco Calimeri, Susanna Cozza, Giovambattista Ianni, Nicola Leone (2010)
Enhancing ASP by functions: Decidable classes and implementation techniquesProceedings of AAAI’10. AAAI Press
Ronald Fagin, Phokion Kolaitis, Renée Miller, Lucian Popa (2003)
Data exchange: semantics and query answering
B. Grau, B. Motik, G. Stoilos, Ian Horrocks (2014)
Completeness Guarantees for Incomplete Ontology Reasoners: Theory and PracticeJ. Artif. Intell. Res., 43
Mario Alviano, Andreas Pieris (2015)
Default Negation for Non-Guarded Existential RulesProceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
Diego Calvanese, Giuseppe Giacomo, D. Lembo, M. Lenzerini, R. Rosati (2006)
Data Complexity of Query Answering in Description LogicsArtif. Intell., 195
U. Hustadt, B. Motik, U. Sattler (2004)
Reducing SHIQ-Description Logic to Disjunctive Datalog Programs
O. Febbraro, N. Leone, F. Ricca, G. Terracina, P. Veltri (2013)
A graphic tool for ontology reasoning under Datalog∃Proceedings of SEBD’13. Curran Associates
Barry Bishop, A. Kiryakov, Damyan Ognyanoff, Ivan Peikov, Zdravko Tashev, Ruslan Velkov (2011)
OWLIM: A family of scalable semantic repositoriesSemantic Web, 2
Jean-François Baget, M. Mugnier, S. Rudolph, M. Thomazo (2011)
Walking the Complexity Lines for Generalized Guarded Existential Rules
E. Sirin, B. Parsia, B. Grau, Aditya Kalyanpur, Yarden Katz (2007)
Pellet: A practical OWL-DL reasonerJ. Web Semant., 5
D. Maier, A. Mendelzon, Y. Sagiv (1979)
Testing implications of data dependenciesACM Transactions on Database Systems (TODS), 4
S. Rudolph, M. Krötzsch, P. Hitzler (2008)
All Elephants are Bigger than All MiceDescription Logics, 353
M. Rodriguez-Muro, Diego Calvanese (2011)
Dependencies to Optimize Ontology Based Data AccessDescription Logics
A. Calí, G. Gottlob, Thomas Lukasiewicz (2009)
Tractable Query Answering over Ontologies with Datalog+/-Description Logics, 477
R. Rosati, Alessandro Almatelli (2010)
Improving Query Answering over DL-Lite Ontologies
C. Beeri, Moshe Vardi (1981)
The Implication Problem for Data Dependencies
Diego Calvanese, Giuseppe Giacomo, D. Lembo, M. Lenzerini, Antonella Poggi, M. Rodriguez-Muro, R. Rosati, M. Ruzzi, Domenico Savo (2011)
The MASTRO system for ontology-based data accessSemantic Web, 2
G. Gottlob, G. Orsi, Andreas Pieris (2014)
Query Rewriting and Optimization for Ontological DatabasesACM Trans. Database Syst., 39
Birte Glimm, Ian Horrocks, C. Lutz, U. Sattler (2007)
Conjunctive Query Answering for the Description Logic SHIQJ. Artif. Intell. Res., 31
M. Rodriguez-Muro, Diego Calvanese (2011)
Dependencies: Making Ontology Based Data Access Work
Enhancing Datalog with existential quantification gives rise to Datalog, a powerful knowledge representation language widely used in ontology-based query answering. In this setting, a conjunctive query is evaluated over a Datalog program consisting of extensional data paired with so-called “existential” rules. Owing to their high expressiveness, such rules make the evaluation of queries undecidable, even when the latter are atomic. Decidable generalizations of Datalog by existential rules have been proposed in the literature (such as weakly acyclic and weakly guarded); but they pay the price of higher computational complexity, hindering the implementation of effective systems. Conversely, the results in this article demonstrate that it is definitely possible to enable fast yet powerful query answering over existential rules that strictly generalize Datalog by ensuring decidability without any complexity overhead. On the theoretical side, we define the class of parsimonious programs that guarantees decidability of atomic queries. We then strengthen this class to strongly parsimonious programs ensuring decidability also for conjunctive queries. Since parsimony is an undecidable property, we single out Shy, an easily recognizable class of strongly parsimonious programs that generalizes Datalog while preserving its complexity even under conjunctive queries. Shy also generalizes the class of linear existential programs, while it is uncomparable to the other main classes ensuring decidability. On the practical side, we exploit our results to implement DLV, an effective system for query answering over parsimonious existential rules. To assess its efficiency, we carry out an experimental analysis, evaluating DLV performances for ontology-based query answering on both real-world and synthetic ontologies.
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Mar 27, 2019
Keywords: Datalog
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.