Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints

DOI10.1007/978-3-662-52921-8_7zbMath1478.68072OpenAlexW2475429212MaRDI QIDQ2820687

Pablo Barceló

Publication date: 9 September 2016

Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-52921-8_7

Mathematics Subject Classification ID

Database theory (68P15) Decidability of theories and sets of sentences (03B25)

Cites Work

• Unnamed Item
• Towards more expressive ontology languages: the query answering problem
• Data exchange: semantics and query answering
• Testing containment of conjunctive queries under functional and inclusion dependencies
• On the complexity of database queries
• Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
• Efficient Approximations of Conjunctive Queries
• Beyond Hypertree Width: Decomposition Methods Without Decompositions
• HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results
• Semantically Acyclic Conjunctive Queries under Functional Dependencies
• Conjunctive query containment and answering under description logic constraints

This page was built for publication: Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints