On the complexity of propositional knowledge base revision, updates, and counterfactuals

Artificial Intelligence

Volumn 57, Issue 2-3, 1992, Pages 227-270

  Eiter, Thomas ^a   Gottlob, Georg ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; LOGIC PROGRAMMING;

COUNTERFACTUALS; MINIMAL CHANGE PRINCIPLE; PROPOSITIONAL KNOWLEDGE BASES; REVISIONS; UPDATES;

KNOWLEDGE BASED SYSTEMS;

EID: 0026940077     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(92)90018-S     Document Type: Article

References (62)

1. On the logic of theory change partial meet contraction and revision functions
2. Introduction to logical programming
3. Language features for flexible handling of exceptions in information systems
4. Saturation, nonmonotonic reasoning and the closed world assumption
5. The complexity of closed world reasoning and circumscription
6. Investigations into a theory of knowledge base revision: preliminary report
7. Updates in propositional databases
8. An assumption-based TMS
9. Linear-time algorithms for testing the satisfiability of propositional Horn theories
10. 2-complete
11. Higher level complexity results for abduction
12. Updating logical databases
13. On the semantics of updates in databases
14. Introducing actions into qualitative simulation
15. Negation as failure: careful closure procedure
16. On the relationship between circumscription and negation as failure
17. Counterfactuals
18. A circumscriptive theorem prover
19. Reasoning about action I: a possible worlds approach
20. Reasoning about action I
21. Complexity results for nonmonotonic logics
22. Updates and counterfactuals
23. Updates and subjunctive queries
24. New developments in structural complexity theory
25. A catalog of complexity classes
26. NP[O(log n)] and sparse Turing-complete sets for NP
27. A unified view of propositional knowledge base updates
28. On the difference between updating a knowledge base and revising it
29. On the difference between updating a knowledge Base and revising it
30. Propositional knowledge base revision and minimal change
31. On the use of an extended relational model to handle changing incomplete information
32. The complexity of optimization problems
33. Closed-world databases and circumscription
34. Modal logic for default reasoning
35. Circumscription—a form of non-monotonic reasoning
36. Applications of circumscription to formalizing common-sense knowledge
37. Non-monotonic logic II nonmonotonic modal theories
38. Non-monotonic logic I
39. On indefinite data bases and the closed world assumption
40. LTUR: a simplified linear time unit resolution for Horn formulas and computer implementation
41. Semantical considerations on nonmonotonic logic
42. A knowledge level analysis of belief revision
43. Belief revision and default reasoning: syntax-based approaches
44. The complexity of facets (and some facets of complexity)
45. An algorithm to compute circumscription
46. On closed-world databases
47. A logic for default reasoning
48. Complexity classification in truth maintenance systems
49. Nonmonotonic reasoning by minimal belief revision
50. Word problems requiring exponential time
51. Bounded query classes
52. Updating propositional formulas
53. Reasoning about action using a possible models approach
54. Circumscriptive semantics for updating databases
55. Deduction in non-Horn databases