Counting and enumerating preferred database repairs
From MaRDI portal
Publication:2193286
DOI10.1016/J.TCS.2020.05.016zbMATH Open1473.68066OpenAlexW3028120587MaRDI QIDQ2193286FDOQ2193286
Authors: Benny Kimelfeld, Ester Livshits, Liat Peterfreund 
Publication date: 25 August 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.05.016
Recommendations
inconsistent databasesfunctional dependenciescategoricityconflict hypergraphpreferred repairrepair countingrepair enumerationsubset repair
Cites Work
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Minimal-change integrity maintenance using tuple deletions
- On generating all maximal independent sets
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Prioritized repairing and consistent query answering in relational databases
- A dichotomy in the complexity of counting database repairs
- Detecting Ambiguity in Prioritized Database Repairing
- Foundations of data quality management
- Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
- Preferred answer sets for ordered logic programs
- Document spanners: a formal approach to information extraction
Cited In (6)
- Disjunctive databases for representing repairs
- Database repairs and analytic tableaux
- Title not available (Why is that?)
- Prioritized repairing and consistent query answering in relational databases
- Computing repairs under functional and inclusion dependencies via argumentation
- General information spaces: measuring inconsistency, rationality postulates, and complexity
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)
