Relational queries computable in polynomial time
Information and Control
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
Datalog extensions for database queries and updates
Journal of Computer and System Sciences
Propositional knowledge base revision and minimal change
Artificial Intelligence
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Modern database systems
Semantics for update rule programs and implementation in a relational database management system
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
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
Active Database Rules with Transaction-Conscious Stable-Model Semantics
DOOD '95 Proceedings of the Fourth International Conference on Deductive and Object-Oriented Databases
Revision Programming, Database Updates and Integrity Constraints
ICDT '95 Proceedings of the 5th International Conference on Database Theory
Expressiveness and Complexity of Active Databases
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Maximal Expansions of Database Updates
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
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
Monotone Expansion of Updates in Logical Databases
LPNMR '99 Proceedings of the 5th 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
Improving Rule Analysis by Means of Triggering and Activation Graphs
RIDS '95 Proceedings of the Second International Workshop on Rules in Database Systems
Formal Characterization of Active Databases
LID '96 Proceedings of the International Workshop on Logic in Databases
The PARK Semantics for Active Rules
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
The computational complexity is explored of finding the minimal real change of a database after an update constrained by a logic program. A polynomial time algorithm is discovered which solves this problem for ground IC in partial interpretations. Formulated in a "property" form, even under the premise of fixed database scheme, this problem turns out to be complete in the first three classes of Σ and Π polynomial hierarchies, depending on many factors: type of interpretation (total or partial), presence of variables, use of negation, arity of predicates, etc. Meanwhile, we show that under strong restrictions to negative constraints the problem is solvable in polynomial time. If the database scheme may vary, the complexity grows exponentially.