Haifa, Israel. July 31–August 5, 2022.
Copyright © 2022 International Joint Conferences on Artificial Intelligence Organization
This paper considers belief change in the Darwiche-Pearl framework. We demonstrate that iterative belief revision is Turing complete by showing how revision operators over ranking functions can simulate every Turing machine. Our result holds even under the condition that the broadly accepted Darwiche-Pearl postulates for iterated revision hold.