Languages that capture complexity classes
SIAM Journal on Computing
Recursive queries and context-free graph grammars
Selected papers of the workshop on Deductive database theory
Equivalence of datalog queries is undecidable
Journal of Logic Programming
Query containment for conjunctive queries with regular expressions
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Reformulation of XML Queries and Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
The Implication Problem for Data Dependencies
Proceedings of the 8th Colloquium on Automata, Languages and Programming
On the complexity of single-rule datalog queries
Information and Computation - Special issue: ICC '99
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Embedded implicational dependencies and their inference problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Reasoning on regular path queries
ACM SIGMOD Record
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
International Conference on Management of Data
Generalized schema-mappings: from termination to tractability
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On chase termination beyond stratification
Proceedings of the VLDB Endowment
Conjunctive queries for a tractable fragment of OWL 1.1
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Query answering under non-guarded rules in datalog+/-
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Chase termination: a constraints rewriting approach
Proceedings of the VLDB Endowment
Advanced processing for ontological queries
Proceedings of the VLDB Endowment
On rules with existential variables: Walking the decidability line
Artificial Intelligence
Ontological query answering with existential rules
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
An extension of complex role inclusion axioms in the description logic SROIQ
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Walking the complexity lines for generalized guarded existential rules
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Query answering in the horn fragments of the description logics SHOIQ and SROIQ
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach
Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach
A broad class of first-order rewritable tuple-generating dependencies
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
| Hi-index | 0.00 |
We introduce monadically defined queries (MODEQs) and nested monadically defined queries (NEMODEQs), two querying formalisms that extend conjunctive queries, conjunctive two-way regular path queries, and monadic Datalog queries. Both can be expressed as Datalog queries and in monadic second-order logic, yet they have a decidable query containment problem and favorable query answering complexities: a data complexity of P, and a combined complexity of NP (MODEQs) and PSpace (NEMODEQs). We show that (NE)MODEQ answering remains decidable in the presence of a well-known generic class of tuple-generating dependencies. In addition, techniques to rewrite queries under dependencies into (NE)MODEQs are introduced. Rewriting can be applied partially, and (NE)MODEQ answering is still decidable if the non-rewritable part of the TGDs permits decidable (NE)MODEQ answering on other grounds.