Chasing Sets: How to Use Existential Rules for Expressive Reasoning (Extended Abstract)

We propose that modern existential rule reasoners can enable fully declarative implementations of rule-based inference methods in knowledge representation, in the sense that a particular calculus is captured by a fixed set of rules that can be evaluated on varying inputs (encoded as facts). We introduce Datalog(S) – Datalog with support for sets – as a surface language for such translations, and show that it can be captured in a decidable fragment of existential rules. We then implement several known inference methods in Datalog(S), and empirically show that an existing existential rule reasoner can thus be used to solve practical reasoning problems.

[1]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[2]  Jacopo Urbani,et al.  Column-Oriented Datalog Materialization for Large Knowledge Graphs , 2016, AAAI.

[3]  Michael Benedikt,et al.  PDQ: Proof-driven Query Answering over Web-based Data , 2014, Proc. VLDB Endow..

[4]  Paolo Papotti,et al.  That's All Folks! LLUNATIC Goes Open Source , 2014, Proc. VLDB Endow..

[5]  Boris Motik,et al.  Benchmarking the Chase , 2017, PODS.

[6]  Jean-François Baget,et al.  On rules with existential variables: Walking the decidability line , 2011, Artif. Intell..

[7]  B. Motik,et al.  RDFox: A Highly-Scalable RDF Store , 2015, SEMWEB.

[9]  Sebastian Rudolph,et al.  Complexities of Horn Description Logics , 2013, TOCL.

[10]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[11]  Chasing Sets : How to Use Existential Rules for Expressive Reasoning IJCAI Submission , 2019 .

[12]  Bruno Marnette,et al.  Generalized schema-mappings: from termination to tractability , 2009, PODS.

[13]  Georg Gottlob,et al.  Expressiveness of guarded existential rule languages , 2014, PODS.

[14]  Emir Pasalic,et al.  Design and Implementation of the LogicBlox System , 2015, SIGMOD Conference.

[15]  Boris Motik,et al.  Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies , 2013, J. Artif. Intell. Res..

[16]  Alin Deutsch,et al.  The chase revisited , 2008, PODS.

[17]  Markus Krötzsch,et al.  Restricted Chase (Non)Termination for Existential Rules with Disjunctions , 2017, IJCAI.

[18]  Markus Krötzsch.  Efficient Rule-Based Inferencing for OWL EL , 2011, IJCAI.

[19]  Jacopo Urbani,et al.  Efficient Model Construction for Horn Logic with VLog - System Description , 2018, IJCAR.

[20]  Markus Krötzsch,et al.  The Combined Approach to Query Answering in Horn-ALCHOIQ (Extended Abstract) , 2019, Description Logics.

[21]  Ian Horrocks,et al.  Consequence-Based Reasoning beyond Horn Ontologies , 2011, IJCAI.

[22]  Thomas Eiter,et al.  Query Rewriting for Horn-SHIQ Plus Rules , 2012, AAAI.

[23]  Jean-François Baget,et al.  Graal: A Toolkit for Query Answering with Existential Rules , 2015, RuleML.

[24]  Magdalena Ortiz,et al.  Rewriting Guarded Existential Rules into Small Datalog Programs , 2018, ICDT.

[25]  Ian Horrocks,et al.  EL-ifying Ontologies , 2014, IJCAR.

[26]  Yavor Nenov,et al.  Pay-as-you-go Ontology Query Answering Using a Datalog Reasoner , 2015, Description Logics.

[27]  Sebastian Rudolph,et al.  Worst-Case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2 , 2010, KR.