Lecture notes in computer science on ICDT '88
View update translation via deduction and annotation
Lecture notes in computer science on ICDT '88
New Generation Computing
Database updates through abduction
Proceedings of the sixteenth international conference on Very large databases
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
An overview of transaction logic
Theoretical Computer Science - Special issue on formal methods in databases and software engineering
Foundations of logic programming
Principles of knowledge representation
On logically justified updates
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Foundations of Logic Programming
Foundations of Logic Programming
Revision Programming, Database Updates and Integrity Constraints
ICDT '95 Proceedings of the 5th International Conference on Database Theory
Update by Means of Inference Rules
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
On Conservative Enforced Updates
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Update-Programs Can Update Programs
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Towards a Tailored Theory of Consistency Enforcement in Databases
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
On Complexity of Updates through Integrity Constraints
CL '00 Proceedings of the First International Conference on Computational Logic
| Hi-index | 0.00 |
Databases with integrity constraints (IC) are considered. For each DB update, i.e. a set of facts to add and of facts to delete, the IC implies its correct expansion: new facts to add and new facts to delete. Simultaneously, each expanded update induces a correct simplification of the IC. In the limit this sequence of expansions and simplifications converges to the maximal correct update expansion independent from the initial DB state. We show that such maximal expansion is computed in square time for partial databases, and that its computation is a co-N P-complete problem in classical databases. However, it is also square time computable in classical DBs under ICs with some restrictions on the use of negation. Computing the real change of the initial DB state after accomplishing an update is a hard problem. The use of maximal update expansion in the place of initial update can substantially simplify computation of a new correct DB state.