Reducing belief revision to circumscription (and vice versa)

DOI10.1016/S0004-3702(97)00016-7zbMath1017.03507WikidataQ127156024 ScholiaQ127156024MaRDI QIDQ1402725

Paolo Liberatore, Marco Schaerf

Publication date: 28 August 2003

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

Computational complexityBelief revisionKnowledge representationCircumscription

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Knowledge representation (68T30)

Related Items

A consistency-based framework for merging knowledge bases, Some computational aspects of DISTANCE SAT, Mixed Iterated Revisions: Rationale, Algorithms, and Complexity, A Distance-Based Operator to Revising Ontologies in DL $\mathcal{SHOQ}$, Seminormalizing a default theory, Note about cardinality-based circumscription, Preprocessing of intractable problems, A consistency-based approach for belief change, Compiling propositional weighted bases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm to compute circumscription
• Results on translating defaults to circumscription
• Eliminating the fixed predicates from a circumscription
• A circumscriptive theorem prover
• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• Propositional knowledge base revision and minimal change
• An efficient method for eliminating varying predicates from a circumscription
• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• The complexity of model checking for circumscriptive formulae
• The complexity of propositional closed world reasoning and circumscription
• Computing circumscriptive databases
• On compact representations of propositional circumscription
• The size of a revised knowledge base
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• On the logic of theory change: Partial meet contraction and revision functions
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Counterfactuals