Consistent query answering for primary keys in Datalog

DOI10.1007/s00224-020-09985-6zbMath1477.68091arXiv1810.03386OpenAlexW3040356704MaRDI QIDQ2035471

Jef Wijsen, Paraschos Koutris

Publication date: 24 June 2021

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.03386

zbMATH Keywords

Datalogconjunctive queriesconsistent query answeringprimary keys

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)

Related Items

Modern Datalog Engines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A dichotomy in the complexity of counting database repairs
• Finite model theory and its applications.
• Elements of finite model theory.
• First-order query rewriting for inconsistent databases
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Scalar aggregation in inconsistent databases.
• A SAT-based system for consistent query answering
• On the data complexity of consistent query answering over graph databases
• Complexity of conservative constraint satisfaction problems
• Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering?
• Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
• An Introduction to Description Logic
• Undirected connectivity in log-space
• Answer sets for consistent query answering in inconsistent databases
• Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints
• Database Theory - ICDT 2005
• A Survey of the Data Complexity of Consistent Query Answering under Key Constraints
• Locality of order-invariant first-order formulas
• On the Relationship between Consistent Query Answering and Constraint Satisfaction Problems