scientific article; zbMATH DE number 7561483

DOI10.4230/LIPIcs.ICDT.2019.23MaRDI QIDQ5091138

Paraschos Koutris, Jef Wijsen

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Datalogconjunctive queriesconsistent query answeringprimary keys

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (2)

Consistent query answering for primary keys in Datalog ⋮ Complexity thresholds in inclusion logic

Cites Work

• 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.
• On the data complexity of consistent query answering over graph databases
• Complexity of conservative constraint satisfaction problems
• Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
• An Introduction to Description Logic
• Database Repairing and Consistent Query Answering
• Directed st-Connectivity Is Not Expressible in Symmetric Datalog
• Undirected connectivity in log-space
• Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints
• Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?
• 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

This page was built for publication: