Lecture notes in computer science on ICDT '88
New Generation Computing
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
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
Database Updates through Abduction
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
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
Logic Programming Updating - A Guided Approach
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
On Complexity of Updates through Integrity Constraints
CL '00 Proceedings of the First International Conference on Computational Logic
| Hi-index | 0.00 |
To find a minimal real change after an update of a database with integrity constraints (IC) expressed by a generalized logic program with explicit negation is proven to be a Σ2p-complete problem. We define a class of operators expanding the input updates correctly with respect to the IC. The particular monotone expansion operator we describe is incrementally computed in square time. It provides a practical optimization of the standard complete choice algorithm resolving the update problem.