4 search results - page 1 / 1 » Double preference relations for generalised belief change |
AI
2010
Springer
13 years 4 months ago
2010
Springer
Many belief change formalisms employ plausibility orderings over the set of possible worlds to determine how the beliefs of an agent ought to be modified after the receipt of a ne...
AI
2011
Springer
12 years 11 months ago
2011
Springer
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding sele...
LORI
2009
Springer
13 years 11 months ago
2009
Springer
Most belief change operators in the AGM tradition assume an underlying plausibility ordering over the possible worlds which is transitive and complete. A unifying structure for the...
JANCL
2007
13 years 4 months ago
2007
ABSTRACT. We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added. The core engine consist...