Explaining updates by minimal sums

Citation
K. Schlechta et R. Dix, Explaining updates by minimal sums, THEOR COMP, 266(1-2), 2001, pp. 819-838
Citations number
17
Categorie Soggetti
Computer Science & Engineering
Journal title
THEORETICAL COMPUTER SCIENCE
ISSN journal
03043975 → ACNP
Volume
266
Issue
1-2
Year of publication
2001
Pages
819 - 838
Database
ISI
SICI code
0304-3975(20010906)266:1-2<819:EUBMS>2.0.ZU;2-D
Abstract
Human reasoning about developments of the world involves always an assumpti on of inertia. We discuss two approaches for formalizing such an assumption , based on the concept of an explanation: (1) there is a general preference relation < given on the set of all explanations and (2) there is a notion of a distance between models and explanations are preferred if their sum of distances is minimal. Each distance dist naturally induces a preference re lation < (dist), We show exactly under which conditions the converse is tru e as well and therefore both approaches are equivalent modulo these conditi ons. Our main result is a general representation theorem in the spirit of K i-aus, Lehmann and Magidor. (C) 2001 Elsevier Science B.V. All rights reser ved.