Belief revision and update: Complexity of model checking

Journal of Computer and System Sciences

Volumn 62, Issue 1, 2001, Pages 43-72

  Liberatore, Paolo ^a   Schaerf, Marco ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; KNOWLEDGE BASED SYSTEMS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS;

COMMON-SENSE REASONING;

FORMAL LOGIC;

EID: 0035250904     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2000.1698     Document Type: Article

References (19)

1. On the logic of theory change: Partial meet contraction and revision functions
2. Language features for flexible handling of exceptions in information systems
3. Comparing space efficiency of propositional knowledge representation formalisms
4. Investigations into a theory of knowledge base revision: Preliminary report
5. On the complexity of propositional knowledge base revision, updates and counterfactuals
6. On the semantics of updates in databases
7. Introducing actions into qualitative simulation
8. Counterfactuals
9. Model checking vs. theorem proving: A manifesto
10. A catalog of complexity classes
11. A unified view of propositional knowledge base updates
12. On the difference between updating a knowledge base and revising it
13. Belief revision and default reasoning: Syntax-based approaches
14. Nonmonotonic reasoning by minimal belief revision
15. The polynomial-time hierarchy
16. Updating propositional formulas
17. Sometimes updates are circumscription