Saturation, nonmonotonic reasoning and the closed-world assumption
Artificial Intelligence
Semantical considerations on nonmonotonic logic
Artificial Intelligence
Closed-world databases and circumscription
Artificial Intelligence
Language features for flexible handling of exceptions in information systems
ACM Transactions on Database Systems (TODS)
Artificial Intelligence
Artificial Intelligence
Negation as failure: Careful closure procedure
Artificial Intelligence
A theory of diagnosis from first principles
Artificial Intelligence
The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
An algorithm to compute circumscription
Artificial Intelligence
On the relationship between circumscription and negation as failure
Artificial Intelligence
A circumscriptive theorem prover
Artificial Intelligence
Hypothetical datalog negation and linear recursion
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
New developments in structural complexity theory
Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
Updating logical databases
On the classification and existence of structures in default logic
Fundamenta Informaticae
Complexity classification of truth maintenance systems
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
A knowledge level analysis of belief revision
Proceedings of the first international conference on Principles of knowledge representation and reasoning
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Propositional knowledge base revision and minimal change
Artificial Intelligence
Nonmonotonic Logic II: Nonmonotonic Modal Theories
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the semantics of updates in databases
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
Introduction to Logic Programming
Introduction to Logic Programming
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the semantics of theory change: arbitration between old and new information
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
(Semantic web) evolution through change logs: problems and solutions
AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
A New Framework for Local Belief Revision
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Revision of Spatial Information by Containment
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Data exchange beyond complete data
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Modifying Intensional Logic Knowledge
Fundamenta Informaticae
| Hi-index | 0.00 |
We study the complexity of several recently proposed methods for updating or revising propositional knowledge bases. In particular, we derive complexity results for the following problem: given a knowledge base T, an update p, and a formula q, decide whether q is derivable from Top, the updated (or revised) knowledge base. This problem amounts to evaluating the counterfactual p q over T. Besides the general case, also subcases are considered, in particular where T is a conjunction of Horn clauses, or where the size of p is bounded by a constant.