{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T07:00:33Z","timestamp":1762326033945,"version":"build-2065373602"},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:p>Despite significant efforts towards extending the AGM paradigm of belief change beyond finitary logics, the computational aspects of AGM have remained almost untouched. We investigate the computability of AGM\n\ncontraction on non-finitary logics, and show an intriguing negative result: there are infinitely many uncomputable AGM contraction functions in such logics. Drastically, we also show that the current de facto standard strategies to control computability, which rely on restricting the space of epistemic states, fail: uncomputability remains in all non-finitary cases. Motivated by this disruptive result, we propose new approaches to controlling computability beyond the finitary realm. Using Linear Temporal Logic (LTL) as a\n\ncase study, we identify an infinite class of fully-rational AGM contraction functions that are computable by design. We use B\u00fcchi automata to construct such functions, and to represent and reason about LTL beliefs.<\/jats:p>","DOI":"10.24963\/kr.2025\/42","type":"proceedings-article","created":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:10:44Z","timestamp":1762323044000},"page":"429-439","source":"Crossref","is-referenced-by-count":0,"title":["Effective AGM Belief Contraction: A Journey Beyond the Finitary Realm"],"prefix":"10.24963","author":[{"given":"Dominik","family":"Klumpp","sequence":"first","affiliation":[{"name":"University of Freiburg, Germany"},{"name":"LIX - CNRS - \u00c9cole Polytechnique, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jandson S.","family":"Ribeiro","sequence":"additional","affiliation":[{"name":"Cardiff University, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"name":"22nd International Conference on Principles of Knowledge Representation and Reasoning {KR-2025}","theme":"Artificial Intelligence","location":"Melbourne, Australia","acronym":"KR-2025","number":"22","sponsor":["Artificial Intelligence Journal","Principles of Knowledge Representation and Reasoning Inc.","Academic College of Tel-Aviv","European Association for Artificial Intelligence","National Science Foundation"],"start":{"date-parts":[[2025,11,11]]},"end":{"date-parts":[[2025,11,17]]}},"container-title":["Proceedings of the TwentySecond International Conference on Principles of Knowledge Representation and Reasoning"],"original-title":[],"deposited":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:11:10Z","timestamp":1762323070000},"score":1,"resource":{"primary":{"URL":"https:\/\/proceedings.kr.org\/2025\/42"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/kr.2025\/42","relation":{},"subject":[],"published":{"date-parts":[[2025,11]]}}}