Abstract
This article proposes a solution to the problem of obtaining plausibility information, which is necessary to perform belief revision: given a sequence of revisions, together with their results, derive a possible initial order that has generated them; this is different from the usual assumption of starting from an all-equal initial order and modifying it by a sequence of revisions. Four semantics for iterated revision are considered: natural, restrained, lexicographic and reinforcement. For each, a necessary and sufficient condition to the existence of an order generating a given history of revisions and results is proved. Complexity is proved coNP complete in all cases but one (reinforcement revision with unbounded sequence length).
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. BRL: A Toolkit for Learning How an Agent Performs Belief Revision;Proceedings of the 14th International Conference on Agents and Artificial Intelligence;2022
2. An Algorithm to Belief Revision and to Verify Consistency of a Knowledge Base;IEEE Latin America Transactions;2021-11
3. Inference Algorithm with Falsifying Patterns for Belief Revision;Lecture Notes in Computer Science;2019
4. Learning Belief Revision Operators;Advances in Artificial Intelligence;2018
5. Belief Merging by Examples;ACM Transactions on Computational Logic;2016-03-28