Complexity of Repair Checking and Consistent Query Answering

Arming, Sebastian; Pichler, Reinhard; Sallinger, Emanuel

doi:10.4230/lipics.icdt.2016.21

Cited by 3 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…C. In other words, this is the Check problem corresponding to the enumeration problem Repair e . For EGDs, this decision problem is DP-complete [29]. Definitely a bit more surprising than in case of Abduction e , we get IncP Σ P 2completeness also for the Repair e problem.…”

Section: Database Repairsmentioning

confidence: 74%

“…The most intensively studied one is the Consistent Query Answering problem, i.e., given a database instance D, a set C of integrity constraints and a boolean query Q, is the query Q true in every repair I of D, w.r.t. C. For EGDs as constraint language and conjunctive queries as query language, this problem has been shown to be Π P 2complete [29]. Another decision problem is the Repair Checking problem, i.e., given database instances D and I, and a set C of integrity constraints, is I a repair of D w.r.t.…”

Section: Database Repairsmentioning

confidence: 99%

See 1 more Smart Citation

A complexity theory for hard enumeration problems

Creignou

Kröll

Pichler

et al. 2019

Discrete Applied Mathematics

Self Cite

View full text Add to dashboard Cite

Complexity theory provides a wealth of complexity classes for analyzing the complexity of decision and counting problems. Despite the practical relevance of enumeration problems, the tools provided by complexity theory for this important class of problems are very limited. In particular, complexity classes analogous to the polynomial hierarchy and an appropriate notion of problem reduction are missing. In this work, we lay the foundations for a complexity theory of hard enumeration problems by proposing a hierarchy of complexity classes and by investigating notions of reductions for enumeration problems.

show abstract

Section: Database Repairsmentioning

confidence: 74%

Section: Database Repairsmentioning

confidence: 99%