Counting and enumerating preferred database repairs
From MaRDI portal
(Redirected from Publication:2193286)
Recommendations
Cites work
- A dichotomy in the complexity of counting database repairs
- Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
- Detecting ambiguity in prioritized database repairing
- Document spanners: a formal approach to information extraction
- Foundations of data quality management
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Minimal-change integrity maintenance using tuple deletions
- On generating all maximal independent sets
- Preferred answer sets for ordered logic programs
- Prioritized repairing and consistent query answering in relational databases
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
Cited in
(9)- Counting subset repairs with functional dependencies
- Disjunctive databases for representing repairs
- Database repairs and analytic tableaux
- scientific article; zbMATH DE number 7566076 (Why is no real title available?)
- Prioritized repairing and consistent query answering in relational databases
- Computing repairs under functional and inclusion dependencies via argumentation
- Detecting ambiguity in prioritized database repairing
- General information spaces: measuring inconsistency, rationality postulates, and complexity
- Database repairing with soft functional dependencies
This page was built for publication: Counting and enumerating preferred database repairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2193286)