A Semantic Characterization of Belief Base Revision for Arbitrary Monotonic Logics

From International Center for Computational Logic

A Semantic Characterization of Belief Base Revision for Arbitrary Monotonic Logics

Talk by Faiq Miftakhul Falakh
The AGM postulates by Alchourron, Gärdenfors, and Makinson continue to represent a cornerstone in research related to belief change. We generalize the approach of Katsuno and Mendelzon (KM) for characterizing AGM base revision from propositional logic to the setting of (multiple) base revision in arbitrary monotonic logics. Our core result is a representation theorem using the assignment of total – yet not transitive – “preference” relations to belief bases. We also provide a characterization of all logics for which our result can be strengthened to preorder assignments (as in KM’s original work).


This talk will take place online via BigBlueButton. To access the room, take one of the following links:

with ZIH-login:

https://selfservice.zih.tu-dresden.de/l/link.php?m=103268&p=3fab0d1a

without ZIH-login:

https://selfservice.zih.tu-dresden.de/link.php?m=103268&p=c61bdf2f