Complexity of redundancy detection on RDF graphs in the presence of rules, constraints, and queries

Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy detection on RDF graphs in the presence of rules in the form of Datalog rules and constraints, in the form of so-called tuple-generating dependencies, and with respect to queries ranging from conjunctive queries up to more complex ones, particularly covering features of SPARQL, such as union, negation, or filters. To this end, we investigate the influence of several problem parameters like restrictions on the size of the rules, the constraints, and/or the queries on the complexity of detecting redundancy. The main result of this paper is a fine-grained complexity analysis of both graph and rule minimisation in various settings.

[1]  RIF RDF and OWL Compatibility (Second Edition) , .

[2]  Axel Polleres,et al.  Dynamic Querying of Mass-Storage RDF Data with Rule-Based Entailment Regimes , 2009, SEMWEB.

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

[4]  Stefan Woltran,et al.  Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries , 2010, RR.

[5]  Jiří Vyskočil,et al.  Transformation of Logic Programs , 2008 .

[6]  Marcelo Arenas,et al.  Semantics and Complexity of SPARQL , 2006, International Semantic Web Conference.

[7]  Klaus W. Wagner,et al.  Bounded Query Classes , 1990, SIAM J. Comput..

[8]  Jorge Pérez,et al.  Minimal Deductive Systems for RDF , 2007, ESWC.

[9]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[10]  Georg Gottlob,et al.  Schema mapping discovery from data instances , 2010, JACM.

[11]  Georg Lausen,et al.  SPARQLing constraints for RDF , 2008, EDBT '08.

[12]  Jens Lehmann,et al.  DBpedia - A crystallization point for the Web of Data , 2009, J. Web Semant..

[13]  Wolfgang Faber,et al.  Complexity results for answer set programming with bounded predicate arities and implications , 2007, Annals of Mathematics and Artificial Intelligence.

[14]  Ronald Fagin,et al.  The Closure of Monadic NP , 2000, J. Comput. Syst. Sci..

[15]  Boris Motik,et al.  Bridging the gap between OWL and relational databases , 2007, WWW '07.

[16]  Michael Meier,et al.  Towards Rule-Based Minimization of RDF Graphs under Constraints , 2008, RR.

[17]  Stefan Woltran,et al.  Replacements in Non-Ground Answer-Set Programming , 2006, WLP.

[18]  Alberto O. Mendelzon,et al.  Foundations of Semantic Web databases , 2011, J. Comput. Syst. Sci..

[19]  Moshe Y. Vardi.  On the complexity of bounded-variable queries (extended abstract) , 1995, PODS '95.

[20]  Andreas Harth,et al.  Scalable Authoritative OWL Reasoning for the Web , 2011, Semantic Services, Interoperability and Web Applications.

[21]  Herman J. ter Horst,et al.  Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary , 2005, J. Web Semant..

[22]  Stefan Decker,et al.  On the Ostensibly Silent 'W' in OWL 2 RL , 2009, RR.

[23]  E. Prud hommeaux,et al.  SPARQL query language for RDF , 2011 .

[24]  Jeffrey D. Uuman.  Principles of database and knowledge- base systems , 1989 .

[25]  Claudio Gutiérrez,et al.  The Expressive Power of SPARQL , 2008, SEMWEB.

[26]  Alberto Pettorossi,et al.  Transformation of Logic Programs , 1994 .

[27]  Catriel Beeri,et al.  A Proof Procedure for Data Dependencies , 1984, JACM.

[28]  Moshe Y. Vardi.  On the Complexity of Bounded-Variable Queries. , 1995, PODS 1995.

[29]  Ian Horrocks,et al.  Description logic programs: combining logic programs with description logic , 2003, WWW '03.