Declarative Semantics for Active Integrity Constraints
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
The consistency extractor system: Answer set programs for consistent query answering in databases
Data & Knowledge Engineering
Logic programming languages for databases and the web
A 25-year perspective on logic programming
Partial repairs that tolerate inconsistency
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
Conflict-aware historical data fusion
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Database integrity mechanism between OLTP and offline data
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
Prioritized repairing and consistent query answering in relational databases
Annals of Mathematics and Artificial Intelligence
Automated Insertion of Exception Handling for Key and Referential Constraints
Journal of Database Management
Policy-based inconsistency management in relational databases
International Journal of Approximate Reasoning
| Hi-index | 0.00 |
This paper introduces active integrity constraints (AICs), an extension of integrity constraints for consistent database maintenance. An active integrity constraint is a special constraint whose body contains a conjunction of literals which must be false and whose head contains a disjunction of update actions representing actions (insertions and deletions of tuples) to be performed if the constraint is not satisfied (that is its body is true). The AICs work in a domino-like manner as the satisfaction of one AIC may trigger the violation and therefore the activation of another one. The paper also introduces founded repairs, which are minimal sets of update actions that make the database consistent, and are specified and “supported” by active integrity constraints. The paper presents: 1) a formal declarative semantics allowing the computation of founded repairs and 2) a characterization of this semantics obtained by rewriting active integrity constraints into disjunctive logic rules, so that founded repairs can be derived from the answer sets of the derived logic program. Finally, the paper studies the computational complexity of computing founded repairs.