Sciweavers

14 search results - page 1 / 3
» A General Family of Preferential Belief Removal Operators
Sort
View
LORI
2009
Springer
13 years 11 months ago
A General Family of Preferential Belief Removal Operators
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...
Richard Booth, Thomas Meyer, Chattrakul Sombatthee...
KR
2010
Springer
13 years 9 months ago
Taxonomy of Improvement Operators and the Problem of Minimal Change
Improvement operators is a family of belief change operators that is a generalization of usual iterated belief revision operators. The idea is to relax the success property, so th...
Sébastien Konieczny, Mattia Medina Grespan,...
AI
2010
Springer
13 years 4 months ago
Double preference relations for generalised belief change
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...
Richard Booth, Samir Chopra, Thomas Meyer, Aditya ...
CORR
2000
Springer
132views Education» more  CORR 2000»
13 years 4 months ago
Uniform semantic treatment of default and autoepistemic logics
We revisit the issue of epistemological and semantic foundations for autoepistemic and default logics, two leading formalisms in nonmonotonic reasoning. We develop a general seman...
Marc Denecker, Victor W. Marek, Miroslaw Truszczyn...
ECSQARU
2009
Springer
13 years 2 months ago
Can the Minimum Rule of Possibility Theory Be Extended to Belief Functions?
Abstract. When merging belief functions, Dempster rule of combination is justified only when sources can be considered as independent. When dependencies are ill-known, it is usual ...
Sébastien Destercke, Didier Dubois