Computability and Complexity of (Iterated) Belief Revision
Aus International Center for Computational Logic
Computability and Complexity of (Iterated) Belief Revision
Vortrag von Kai Sauerwald
- Veranstaltungsort: APB 3027
- Beginn: 5. Oktober 2022 um 14:00
- Ende: 5. Oktober 2022 um 15:00
- Event series: Research Seminar Logic and AI
- iCal
Belief revision denotes the process of the incorporation of new information while maintaining consistency whenever possible. In this talk, at first, we consider some known complexity results for belief revision. Second, we consider the recent insight that the typical framework for iterated belief revision is computationally universal.