On the finite controllability of conjunctive query answering in databases under open-world assumption

DOI10.1016/j.jcss.2010.04.011zbMath1215.68094DBLPjournals/jcss/Rosati11OpenAlexW2083882774WikidataQ64360204 ScholiaQ64360204MaRDI QIDQ532372

Riccardo Rosati

Publication date: 4 May 2011

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2010.04.011

zbMATH Keywords

integrity constraintsquery answeringfinite controllabilityincomplete databasesopen-world assumption

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (8)

On the data complexity of consistent query answering ⋮ Certain answers over incomplete XML documents: extending tractability boundary ⋮ The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems ⋮ Towards more expressive ontology languages: the query answering problem ⋮ Tractable query answering and rewriting under description logic constraints ⋮ Logical separability of labeled data examples under ontologies ⋮ Structural tractability of enumerating CSP solutions ⋮ Guarded Ontology-Mediated Queries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conjunctive query containment with respect to views and constraints
• The complexity of querying indefinite data about linearly ordered domains
• Deciding expressive description logics in the framework of resolution
• Testing containment of conjunctive queries under functional and inclusion dependencies
• Inclusion dependencies and their interaction with functional dependencies
• How to prevent interaction of functional and inclusion dependencies
• Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
• The implication problem for functional and inclusion dependencies
• Formal Systems for Tuple and Equality Generating Dependencies
• On XML integrity constraints in the presence of DTDs
• Polynomial-time implication problems for unary inclusion dependencies
• Data exchange: getting to the core
• The Implication Problem for Functional and Inclusion Dependencies is Undecidable
• A Proof Procedure for Data Dependencies
• On conjunctive queries containing inequalities
• Answer sets for consistent query answering in inconsistent databases
• Recursive query plans for data integration
• Answering queries using views: A survey

This page was built for publication: On the finite controllability of conjunctive query answering in databases under open-world assumption