Reducing belief revision to circumscription (and vice versa)

DOI10.1016/S0004-3702(97)00016-7MaRDI QIDQ1402725zbMATH OpenWikidataFDO

Authors Paolo Liberatore, Marco Schaerf

Publication date 28 August 2003

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0004-3702(97)00016-7

zbMATH Keywords

Belief revisionCircumscriptionComputational complexityKnowledge representation

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 549967
• Reason to believe
• scientific article; zbMATH DE number 4174359
• scientific article; zbMATH DE number 67506
• scientific article; zbMATH DE number 978236

Cites work

• A circumscriptive theorem prover
• A logic for default reasoning
• An algorithm to compute circumscription
• An efficient method for eliminating varying predicates from a circumscription
• Circumscription - a form of non-monotonic reasoning
• Computing circumscriptive databases
• Counterfactuals
• Eliminating the fixed predicates from a circumscription
• scientific article; zbMATH DE number 4174359 (Why is no real title available?)
• scientific article; zbMATH DE number 44621 (Why is no real title available?)
• scientific article; zbMATH DE number 140403 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1142309 (Why is no real title available?)
• scientific article; zbMATH DE number 1509480 (Why is no real title available?)
• scientific article; zbMATH DE number 4185089 (Why is no real title available?)
• scientific article; zbMATH DE number 4187148 (Why is no real title available?)
• Knowledge in flux. Modeling the dynamics of epistemic states
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• On compact representations of propositional circumscription
• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• On the logic of theory change: Partial meet contraction and revision functions
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• Propositional knowledge base revision and minimal change
• Results on translating defaults to circumscription
• The complexity of model checking for circumscriptive formulae
• The complexity of propositional closed world reasoning and circumscription
• The size of a revised knowledge base

Cited in

(10)

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

This page was built for publication: Reducing belief revision to circumscription (and vice versa)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1402725)