Using Transfinite Ordinal Conditional Functions

DOI10.1007/978-3-642-02906-6_35zbMath1245.68188OpenAlexW1540547320MaRDI QIDQ3638166

Sébastien Konieczny

Publication date: 2 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02906-6_35

Mathematics Subject Classification ID

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

Related Items (3)

Infinite Ordinals and Finite Improvement ⋮ Logic based merging ⋮ Nearly Counterfactual Revision

Cites Work

• Unnamed Item
• Unnamed Item
• Iterated belief revision, revised
• Propositional knowledge base revision and minimal change
• On the logic of iterated belief revision
• Iterated revision and minimal change of conditional beliefs
• Belief revision: A critique
• Three Scenarios for the Revision of Epistemic States
• On the logic of theory change: Partial meet contraction and revision functions
• On the semantics of combination operations

This page was built for publication: Using Transfinite Ordinal Conditional Functions