Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning

We study the problem of rewriting a disjunctive datalog program into plain datalog. We show that a disjunctive program is rewritable if and only if it is equivalent to a linear disjunctive program, thus providing a novel characterisation of datalog rewritability. Motivated by this result, we propose weakly linear disjunctive datalog--a novel rule-based KR language that extends both datalog and linear disjunctive datalog and for which reasoning is tractable in data complexity. We then explore applications of weakly linear programs to ontology reasoning and propose a tractable extension of OWL 2 RL with disjunctive axioms. Our empirical results suggest that many non-Horn ontologies can be reduced to weakly linear programs and that query answering over such ontologies using a datalog engine is feasible in practice.

[1]  Boris Motik,et al.  Hypertableau Reasoning for Description Logics , 2009, J. Artif. Intell. Res..

[2]  Hisao Tamaki,et al.  Unfold/Fold Transformation of Logic Programs , 1984, ICLP.

[3]  Boris Motik,et al.  Reasoning in description logics using resolution and deductive databases , 2006 .

[4]  Luigi Palopoli,et al.  More on tractable disjunctive Datalog , 2000, J. Log. Program..

[5]  Fang Wei,et al.  Foundations of Rule-Based Query Answering , 2007 .

[6]  Georg Gottlob,et al.  Disjunctive datalog , 1997, TODS.

[7]  Manolis Gergatsoulis,et al.  Linearisability on datalog programs , 2003, Theor. Comput. Sci..

[8]  Georg Gottlob,et al.  On the Complexity of Ontological Reasoning under Disjunctive Existential Rules , 2012, MFCS.

[9]  Andreas Pieris,et al.  The Impact of Disjunction on Query Answering Under Guarded-Based Existential Rules , 2013, Description Logics.

[10]  Yarden Katz,et al.  Pellet: A practical OWL-DL reasoner , 2007, J. Web Semant..

[11]  Luigi Palopoli,et al.  Reasoning with Minimal Models: Efficient Algorithms and Applications. , 1994, KR 1994.

[12]  Diego Calvanese,et al.  The DL-Lite Family and Relations , 2009, J. Artif. Intell. Res..

[13]  Barry Bishop,et al.  OWLIM: A family of scalable semantic repositories , 2011, Semantic Web.

[14]  Yavor Nenov,et al.  Parallel Materialisation of Datalog Programs in Centralised, Main-Memory RDF Systems , 2014, AAAI.

[15]  ProgrammingEvgeny Dantsin.  Complexity and Expressive Power of Logi , 1997 .

[16]  Ian Horrocks,et al.  Making the most of your triple store: query answering in OWL 2 using an RL reasoner , 2013, WWW.

[17]  Bernardo Cuenca Grau,et al.  OWL 2 Web Ontology Language: Profiles , 2009 .

[18]  Boris Motik,et al.  Computing Datalog Rewritings Beyond Horn Ontologies , 2013, IJCAI.

[19]  Mihalis Yannakakis,et al.  On Datalog vs. Polynomial Time , 1995, J. Comput. Syst. Sci..

[20]  Li Ma,et al.  Towards a Complete OWL Ontology Benchmark , 2006, ESWC.

[21]  Maurizio Proie ' Iti.  THE LOOP ABSORPTION AND THE GENERALIZATION STRATEGIES FOR THE DEVELOPMENT OF LOGIC PROGRAMS AND PARTIAL DEDUCTION , 1993 .

[22]  Manolis Gergatsoulis,et al.  Unfold/fold Transformations for Disjunctive Logic Programs , 1997, Inf. Process. Lett..

[23]  Ian Horrocks,et al.  Framework for an Automated Comparison of Description Logic Reasoners , 2006, SEMWEB.

[24]  Zhe Wu,et al.  Implementing an Inference Engine for RDFS/OWL Constructs and User-Defined Rules in Oracle , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[25]  Boris Motik,et al.  Reasoning in Description Logics by a Reduction to Disjunctive Datalog , 2007, Journal of Automated Reasoning.

[26]  Bernardo Cuenca Grau,et al.  Sufficient Conditions for First-Order and Datalog Rewritability in ELU , 2013, Description Logics.

[27]  Wolfgang Faber,et al.  The DLV system for knowledge representation and reasoning , 2002, TOCL.

[28]  Carsten Lutz,et al.  Non-Uniform Data Complexity of Query Answering in Description Logics , 2012, Description Logics.