Minimal-change integrity maintenance using tuple deletions
From MaRDI portal
Publication:1776402
DOI10.1016/j.ic.2004.04.007zbMath1075.68022arXivcs/0212004OpenAlexW2163600218MaRDI QIDQ1776402
Jan Chomicki, Jerzy Marcinkowski
Publication date: 12 May 2005
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0212004
Related Items
On the data complexity of consistent query answering ⋮ On the data complexity of consistent query answering over graph databases ⋮ Inconsistency-tolerant query answering for existential rules ⋮ Consistent query answering via ASP from different perspectives: Theory and practice ⋮ Mining approximate interval-based temporal dependencies ⋮ Deductive databases for computing certain and consistent answers from mediated data integration systems ⋮ From causes for database queries to repairs and model-based diagnosis and back ⋮ On repairing and querying inconsistent probabilistic spatio-temporal databases ⋮ A remark on the complexity of consistent conjunctive query answering under primary key violations ⋮ Magic Sets and their application to data integration ⋮ First-order query rewriting for inconsistent databases ⋮ Extending inclusion dependencies with conditions ⋮ Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering? ⋮ Taming primary key violations to query large inconsistent data via ASP ⋮ On the complexity of sampling query feedback restricted database repair of functional dependency violations ⋮ Counting and enumerating preferred database repairs ⋮ An epistemic approach to model uncertainty in data-graphs ⋮ A three-valued semantics for querying and repairing inconsistent databases ⋮ On measuring inconsistency in definite and indefinite databases with denial constraints ⋮ Reasoning with Uncertainty by Nmatrix–Metric Semantics ⋮ Prioritized repairing and consistent query answering in relational databases ⋮ Probabilistic query answering over inconsistent databases ⋮ Distance semantics for database repair ⋮ Expressive power of entity-linking frameworks ⋮ First-order under-approximations of consistent query answers ⋮ Querying incomplete data over extended ER schemata ⋮ Magic sets for disjunctive Datalog programs ⋮ A framework for reasoning under uncertainty based on non-deterministic distance semantics ⋮ Simplified forms of computerized reasoning with distance semantics ⋮ Distance-based paraconsistent logics ⋮ Disjunctive databases for representing repairs ⋮ Unnamed Item ⋮ On the complexity and approximability of repair position selection problem ⋮ Complexity thresholds in inclusion logic ⋮ A dichotomy in the complexity of consistent query answering for queries with two atoms ⋮ On the complexity of inconsistency measurement ⋮ General information spaces: measuring inconsistency, rationality postulates, and complexity ⋮ Database repair via event-condition-action rules in dynamic logic ⋮ Policy-based inconsistency management in relational databases
Cites Work
- Prioritized repairing and consistent query answering in relational databases
- Complexity tailored design: a new design methodology for databases with incomplete information.
- Computable queries for relational data bases
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- Programming with non-determinism in deductive databases
- Integrity constraints for XML
- Scalar aggregation in inconsistent databases.
- Datalog with non-deterministic choice computes NDB-PTIME
- Answer sets for consistent query answering in inconsistent databases
- Recursive query plans for data integration
- Logic Programming
- Inconsistency Tolerance
- Advances in Databases and Information Systems
- Answering queries using views: A survey
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
