Journal of Logic and Computation Advance Access originally published online on May 7, 2007
Journal of Logic and Computation 2007 17(3):479-498; doi:10.1093/logcom/exm010
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
Original Articles |
Contraction Based on Sentential Selection
Division of Philosophy, Royal Institute of Technology, Stockholm, Sweden. E-mail: soh{at}kth.se
Received 6 July 2006.
| Abstract |
|---|
The properties of full meet contraction are investigated, and it is shown to be a useful building-block in the construction of composite contraction operators. This is followed by a detailed investigation of specified meet contraction, i.e. the operation ÷ such that K ÷ p = K
f(p), where
is full meet contraction and f is a function from sentences to sentences. A number of realistic examples of belief contraction are discussed, and it is shown how the properties of contraction differ according to how the sentence to be contracted is situated in the structure of the belief state. Some plausible properties of f are proposed, and it is shown how they correspond to properties of the contraction operator.
Keywords: Belief change; partial meet contraction; full meet contraction; specified meet contraction; sentential selector; recovery; eradication; eradicative reconstruction