The consistency extractor system: Answer set programs for consistent query answering in databases

@article{Marileo2010TheCE,
  title={The consistency extractor system: Answer set programs for consistent query answering in databases},
  author={M{\'o}nica Caniup{\'a}n Marileo and Leopoldo E. Bertossi},
  journal={Data Knowl. Eng.},
  year={2010},
  volume={69},
  pages={545-572}
}
We describe the Consistency Extractor System (Cons Ex) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with respect to certain integrity constraints. In order to solve this task, Cons Ex uses answers set programming. More precisely, Cons Ex uses disjunctive logic programs with stable models semantics to specify and reason with the repairs, i.e. with the consistent virtual instances that minimally depart from the original… Expand
From Database Repair Programs to Consistent Query Answering in Classical Logic (extended abstract)
TLDR
This paper shows how to use the repair programs to transform the problem of consistent query answering into a problem of reasoning wrt a concrete theory written in second-order predicate logic, and investigates how a first-order theory can be obtained instead, by applying second- order quantifier elimination techniques. Expand
A SAT-based System for Consistent Query Answering
TLDR
The consistent answers to a query on an inconsistent database is the intersection of the answers to the query on every repair, i.e., on every consistent database that differs from the given inconsistent one in a minimal way. Expand
CAvSAT: Answering Aggregation Queries over Inconsistent Databases via SAT Solving
TLDR
CAvSAT is the first system that is capable of handling unions of SPJ queries with aggregation operators SUM and COUNT, and databases that are inconsistent w.r.t. key constraints, functional dependencies, and denial constraints. Expand
Characterizing Causes for Query Answers in Databases via Database Repairs and their Computation through Repair Programs
TLDR
Answer-set programs that specify repairs of databases are used as a basis for solving computational and reasoning problems about causes, and causes are also introduced at the attribute level by appealing to a both null-based and attribute-based repair semantics. Expand
CAvSAT: A System for Query Answering over Inconsistent Databases
TLDR
This work proposes a novel approach that has a potential to build a comprehensive and scalable CQA system CAvSAT (Consistent Answering via Satisfiability), implemented using this approach. Expand
Specifying and computing causes for query answers in databases via database repairs and repair-programs
TLDR
In this work, answer-set programs that specify database repairs are used as a basis for solving computational and reasoning problems around causality in databases, including causal responsibility. Expand
Tackling Polytype Queries in Inconsistent Databases: Theory and Algorithm
TLDR
This paper presents several algorithms to tackle a large and practical class of queries, which can obtain the rewritten queries for computing consistent answers. Expand
CQA-WF: Consistent Query Answers to Conjunctive Queries Using the Well-Founded Semantics
TLDR
CQA-WF, a system that allows the computation of consistent answers to conjunctive queries over inconsistent databases with respect to functional dependencies (FDs) and evaluates logic programs under the WFS, which has lower data complexity than the stable models semantics. Expand
Characterizing and Computing Causes for Query Answers in Databases from Database Repairs and Repair Programs
TLDR
Answer-set programs that specify repairs of databases are used as a basis for solving computational and reasoning problems about causes and causes are also introduced at the attribute level by appealing to a both null-based and attribute-based repair semantics. Expand
Efficient Querying of Inconsistent Databases with Binary Integer Programming
TLDR
EQUIP is a technique, based on Binary Integer Programming, that repeatedly searches for repairs to eliminate candidate consistent answers until no further such candidates can be eliminated and significantly outperforms existing systems for computing the consistent answers to queries in this class. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 79 REFERENCES
The Consistency Extractor System: Querying Inconsistent Databases Using Answer Set Programs
We present the Consistency Extractor System(ConsEx) that uses answer set programmingto compute consistent answers to first-order queries posed to relational databases that may be inconsistent wrtExpand
Optimizing repair programs for consistent query answering
TLDR
This paper makes repair programs more compact by eliminating redundant rules and unnecessary programs denial constraints, and analyzes the implementation in DLV of queries with aggregate functions. Expand
Answer sets for consistent query answering in inconsistent databases
TLDR
This paper applies logic programming based on answer sets to the problem of retrieving consistent information from a possibly inconsistent database, and focuses mainly on logic programs for binary integrity constraints, among which most of the integrity constraints found in practice are found. Expand
Logic Programs for Querying Inconsistent Databases
TLDR
This paper shows how to write repair programs for universal and referential ICs; their correctness is established and how to run them on top of the DLV system is established. Expand
Optimizing and implementing repair programs for consistent query answering in databases
TLDR
A system which implements optimized logic programs and efficient methods to compute consistent answers to first-order queries and proposes the use of the well-founded semantics (WFS) as an alternative way to obtain consistent answers. Expand
Characterizing and Computing Semantically Correct Answers from Databases with Annotated Logic and Answer Sets
TLDR
This paper addresses the problem of specifying those repaired versions of the database as the minimal models of a theory written in Annotated Predicate Logic, and shows how to specify database repairs using disjunctive logic program with annotation arguments and a classical stable model semantics. Expand
On the decidability and complexity of query answering over inconsistent and incomplete databases
TLDR
This paper identifies the maximal class of inclusion dependencies under which query answering is decidable in the presence of key dependencies and establishes decidability and complexity results for query answering under different assumptions on data. Expand
Consistent query answering under inclusion dependencies
TLDR
This paper shows and analyze how to specify those repairs using disjunctive logic program with a stable model semantics in the presence of referential ICs, and presents results about cases where the implementation of consistent query answering can be made more efficient due to the fact that the program can be simplified into a non-disjunctive program. Expand
A Logical Framework for Querying and Repairing Inconsistent Databases
TLDR
This paper proposes a general logic framework for computing repairs and consistent answers over inconsistent databases and proposes a technique based on the rewriting of constraints into (prioritized) extended disjunctive rules with two different forms of negation (negation as failure and classical negation). Expand
Prioritized repairing and consistent query answering in relational databases
TLDR
This work investigates the framework of preferred consistent query answers, in which user preferences are used to narrow down the set of repairs to a set of preferred repairs, and axiomatize desirable properties of preferred repaired. Expand
...
1
2
3
4
5
...