Chandler, Jake and Booth, Richard  ORCID: https://orcid.org/0000-0002-6647-6381
2025.
Parallel belief revision via order aggregation.
Presented at: 34th International Joint Conference on Artificial Intelligence (IJCAI 2025),
Montreal, Canada,
16 - 22 August 2025.
Published in: Kwok, James ed.
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence.
IJCAI,
pp. 4419-4426.
10.24963/ijcai.2025/492
|
Preview |
PDF
- Accepted Post-Print Version
Download (415kB) | Preview |
Abstract
Despite efforts to better understand the constraints that operate on single-step parallel (aka ``package'', ``multiple'') revision, very little work has been carried out on how to extend the model to the iterated case. A recent paper by Delgrande & Jin outlines a range of relevant rationality postulates. While many of these are plausible, they lack an underlying unifying explanation. We draw on recent work on iterated parallel contraction to offer a general method for extending serial iterated belief revision operators to handle parallel change. This method, based on a family of order aggregators known as TeamQueue aggregators, provides a principled way to recover the independently plausible properties that can be found in the literature, without yielding the more dubious ones. Keywords:
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Date Type: | Publication |
| Status: | Published |
| Schools: | Schools > Computer Science & Informatics |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Publisher: | IJCAI |
| Date of First Compliant Deposit: | 21 May 2025 |
| Date of Acceptance: | 29 April 2025 |
| Last Modified: | 30 Sep 2025 11:03 |
| URI: | https://orca.cardiff.ac.uk/id/eprint/178411 |
Actions (repository staff only)
 |
Edit Item |
Altmetric
Altmetric