Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics

We study query containment in three closely related formalisms: monadic disjunctive Datalog (MDDLog), MMSNP (a logical generalization of constraint satisfaction problems), and ontology-mediated queries (OMQs) based on expressive description logics and unions of conjunctive queries. Containment in MMSNP was known to be decidable due to a result by Feder and Vardi, but its exact complexity has remained open. We prove 2NExpTime-completeness and extend this result to monadic disjunctive Datalog and to OMQs.

[1]  Florent R. Madelaine.  On the Containment of Forbidden Patterns Problems , 2010, CP.

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

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

[4]  Georg Gottlob,et al.  Querying the Guarded Fragment with Transitivity , 2013, ICALP.

[5]  Tomás Feder,et al.  On the Complexity of MMSNP , 2012, SIAM J. Discret. Math..

[6]  Carsten Lutz,et al.  The Complexity of Conjunctive Query Answering in Expressive Description Logics , 2008, IJCAR.

[7]  Michael Benedikt,et al.  Monadic Datalog Containment , 2012, ICALP.

[8]  Haim Gaifman,et al.  Decidable Optimization Problems for Database Logic Programs (Preliminary Report) , 1988, STOC 1988.

[9]  Alon Y. Halevy,et al.  CARIN: A Representation Language Combining Horn Rules and Description Logics , 1996, ECAI.

[10]  Haim Gaifman,et al.  Decidable optimization problems for database logic programs , 1988, STOC '88.

[11]  Thomas Schwentick,et al.  Optimizing Conjunctive Queries over Trees Using Schema Information , 2008, MFCS.

[12]  Sebastian Rudolph,et al.  Reasonable highly expressive query languages , 2015 .

[13]  Diego Calvanese,et al.  Ontologies and Databases: The DL-Lite Approach , 2009, Reasoning Web.

[14]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[15]  Pierre Senellart,et al.  Provenance Circuits for Trees and Treelike Instances , 2015, ICALP.

[16]  Manuel Bodirsky,et al.  Datalog and constraint satisfaction with infinite templates , 2006, J. Comput. Syst. Sci..

[17]  Diego Calvanese,et al.  Dwq : Esprit Long Term Research Project, No 22469 on the Decidability of Query Containment under Constraints on the Decidability of Query Containment under Constraints , 2022 .

[18]  Thomas Eiter,et al.  Query Answering in the Description Logic S , 2010, Description Logics.

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

[20]  Claude Tardif,et al.  A Characterisation of First-Order Constraint Satisfaction Problems , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[21]  Diego Calvanese,et al.  Containment of Regular Path Queries under Description Logic Constraints , 2011, IJCAI.

[22]  Oded Shmueli,et al.  Equivalence of DATALOG Queries is Undecidable , 1993, J. Log. Program..

[23]  Carsten Lutz,et al.  Query Containment in Description Logics Reconsidered , 2012, KR.