Forgetting in short and heterogeneous sequences of belief revisions
Computational Complexity
2025-05-19 v2 Artificial Intelligence
Abstract
Forgetting a specific belief revision episode may not erase information because the other revisions may provide or entail the same information. Whether it does was proved coNP-hard for sequences of two arbitrary lexicographic revisions or arbitrarily long lexicographic Horn revisions. A polynomial algorithm is presented for the case of two lexicographic Horn revision. Heterogeneous sequences, including revisions other than lexicographic, were proved to belong in Delta2. Their previously proved coNP-hardness is enhanced to Dp-hardness.
Keywords
Cite
@article{arxiv.2504.13986,
title = {Forgetting in short and heterogeneous sequences of belief revisions},
author = {Paolo Liberatore},
journal= {arXiv preprint arXiv:2504.13986},
year = {2025}
}
Comments
arXiv admin note: substantial text overlap with arXiv:2402.15445, arXiv:2305.09200