Iterated Contraction Based on Indistinguishability

DOI10.1007/978-3-642-35722-0_14zbMath1437.03063OpenAlexW59579818MaRDI QIDQ3455845

Konstantinos Georgatos

Publication date: 11 December 2015

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35722-0_14

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42)

Related Items (3)

Graph-Based Belief Merging ⋮ A Logic for Belief Contraction ⋮ Geodesic merging

Cites Work

• Global and iterated contraction and revision: an exploration of uniform and semi-uniform approaches
• Multiple and iterated contraction reduced to single-step single-sentence contraction
• On the status of the postulate of recovery in the logic of theory change
• First-order logics for comparative similarity
• Belief contraction without recovery
• On the logic of theory change: Contraction without recovery
• Expansion and contraction of finite states
• Distance semantics for belief revision
• Conditioning by Minimizing Accessibility
• Geodesic Revision
• On the logic of theory change: Partial meet contraction and revision functions
• A New Approach to Quantum Logic
• On Indistinguishability and Prototypes

This page was built for publication: Iterated Contraction Based on Indistinguishability