Belief contraction and erasure in fragments of propositional logic. (11th March 2022)

• Record Type: Journal Article
• Authors: Creignou, Nadia; Ktari, RaÏda; Papini, Odile
• Is Part Of: Journal of logic and computation. Volume 32:Number 7(2022)
• Page Start: 1436
• Page End: 1468
• Publication Date: 2022-03-11
• Subjects: Belief change -- belief contraction -- belief erasure -- fragments of propositional logic -- knowledge representation and reasoning; Logic programming -- Periodicals; Logic, Symbolic and mathematical -- Periodicals; Computational complexity -- Periodicals; 005.115
• DOI: 10.1093/logcom/exac005
• Languages: English
• ISSNs: 0955-792X

Abstract

Abstract: Recently, belief change within the framework of fragments of propositional logic has gained attention. In the context of revision, it has been proposed to refine existing operators so that they operate within propositional fragments and that the result of revision remains in the fragment under consideration. Later, this notion of refinement was generalized to belief change operators. Whereas refinement allowed one to define concrete rational operators adapted to propositional fragments in the context of revision and update, it has to be specified for contraction and erasure. We propose a specific notion of refinement for contraction and erasure operators, called reasonable refinement . This allows us to provide refined contraction and erasure operators that satisfy the basic postulates. We study the logical properties of reasonable refinement of two model-based contraction operators and two model-based erasure operators. Our approach is not limited to the Horn fragment but applicable to many fragments of propositional logic, like Krom and affine fragments.