On the complexity of propositional knowledge base revision, updates, and counterfactuals
- 31 October 1992
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 57 (2-3) , 227-270
- https://doi.org/10.1016/0004-3702(92)90018-s
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- A circumscriptive theorem proverArtificial Intelligence, 1989
- On the relationship between circumscription and negation as failureArtificial Intelligence, 1989
- Reasoning about action IArtificial Intelligence, 1988
- Negation as failure: Careful closure procedureArtificial Intelligence, 1986
- CounterfactualsArtificial Intelligence, 1986
- An assumption-based TMSArtificial Intelligence, 1986
- Language features for flexible handling of exceptions in information systemsACM Transactions on Database Systems, 1985
- On the logic of theory change: Partial meet contraction and revision functionsThe Journal of Symbolic Logic, 1985
- Saturation, nonmonotonic reasoning and the closed-world assumptionArtificial Intelligence, 1985
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984