{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T09:49:06Z","timestamp":1747216146742,"version":"3.40.5"},"reference-count":0,"publisher":"IOS Press","isbn-type":[{"type":"electronic","value":"9781643685489"}],"license":[{"start":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T00:00:00Z","timestamp":1729036800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,10,16]]},"abstract":"<jats:p>Belief change is an important topic of knowledge representation and reasoning in artificial intelligence. Within the logical framework, the AGM approach has become a standard and various belief change operations have been considered. While revision, contraction and updating have given rise to a great deal of work, erasure has so far attracted less interest. Erasure is to contraction what update is to revision.This article deals with the study of erasure within the framework of propositional logic. It extends Katsuno and Mendelzon\u2019s approach with additional postulates capturing the minimality of change and proposes two representation theorems for erasure operators, one in terms of total preorders on interpretations, the other in terms of partial preorders on interpretations. Finally, it completes the work of Caridroit, Konieczny and Marquis for contraction by proposing a new representation theorem for contraction operators in terms of partial preorders on interpretations.<\/jats:p>","DOI":"10.3233\/faia240619","type":"book-chapter","created":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T12:56:25Z","timestamp":1729169785000},"source":"Crossref","is-referenced-by-count":0,"title":["Belief Erasure in Propositional Logic"],"prefix":"10.3233","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6522-6363","authenticated-orcid":false,"given":"Nadia","family":"Creignou","sequence":"first","affiliation":[{"name":"Aix Marseille Univ, CNRS, LIS, Marseille, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9678-6460","authenticated-orcid":false,"given":"Ra\u00efda","family":"Ktari","sequence":"additional","affiliation":[{"name":"Aix Marseille Univ, CNRS, LIS, Marseille, France"},{"name":"Universit\u00e9 de Sfax, ISIMS, CES-Lab LR11ES49, Sfax, Tunisie"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7537-5822","authenticated-orcid":false,"given":"Odile","family":"Papini","sequence":"additional","affiliation":[{"name":"Aix Marseille Univ, CNRS, LIS, Marseille, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","ECAI 2024"],"original-title":[],"link":[{"URL":"https:\/\/ebooks.iospress.nl\/pdf\/doi\/10.3233\/FAIA240619","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T12:56:25Z","timestamp":1729169785000},"score":1,"resource":{"primary":{"URL":"https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA240619"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,16]]},"ISBN":["9781643685489"],"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/faia240619","relation":{},"ISSN":["0922-6389","1879-8314"],"issn-type":[{"type":"print","value":"0922-6389"},{"type":"electronic","value":"1879-8314"}],"subject":[],"published":{"date-parts":[[2024,10,16]]}}}