Taking Levi Identity Seriously: A Plea for Iterated Belief Contraction

Author(s):  
Abhaya Nayak ◽  
Randy Goebel ◽  
Mehmet Orgun ◽  
Tam Pham
2013 ◽  
Vol 6 (2) ◽  
pp. 183-204 ◽  
Author(s):  
SVEN OVE HANSSON

AbstractThe outcome set of a belief change operator is the set of outcomes that can be obtained with it. Axiomatic characterizations are reported for the outcome sets of the standard AGM contraction operators and eight types of base-generated contraction. These results throw new light on the properties of some of these operators.


2000 ◽  
Vol 65 (2) ◽  
pp. 605-626 ◽  
Author(s):  
Alexander Bochman

AbstractA notion of an epistemic state is introduced as a generalization of common representations suggested for belief change. Based on it, a new kind of nonmonotonic inference relation corresponding to belief contractions is defined. A number of representation results is established that cover both traditional AGM contractions and contractions that do not satisfy recovery.


2011 ◽  
Vol 41 (1) ◽  
pp. 115-142 ◽  
Author(s):  
Raghav Ramachandran ◽  
Abhaya C. Nayak ◽  
Mehmet A. Orgun
Keyword(s):  

Author(s):  
Lee Flax

We give an approach to cognitive modelling, which allows for richer expression than the one based simply on the firing of sets of neurons. The object language of the approach is first-order logic augmented by operations of an algebra, PSEN. Some operations useful for this kind of modelling are postulated: combination, comparison, and inhibition of sets of sentences. Inhibition is realised using an algebraic version of AGM belief contraction (Gärdenfors, 1988). It is shown how these operations can be realised using PSEN. Algebraic modelling using PSEN is used to give an account of an explanation of some signs and symptoms of schizophrenia due to Frith (1992) as well as a proposal for the cognitive basis of autonomic computing. A brief discussion of the computability of the operations of PSEN is also given.


Sign in / Sign up

Export Citation Format

Share Document