Computability and Complexity of (Iterated) Belief Revision
From International Center for Computational Logic
Computability and Complexity of (Iterated) Belief Revision
Talk by Kai Sauerwald
- Location: APB 3027
- Start: 5. October 2022 at 2:00 pm
- End: 5. October 2022 at 3:00 pm
- 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.
