Arrow Research search
Back to TCS

TCS 2001

Explaining updates by minimal sums

Journal Article journal-article Computer Science · Theoretical Computer Science

Abstract

Human reasoning about developments of the world involves always an assumption 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 relation ≺ dist. We show exactly under which conditions the converse is true as well and therefore both approaches are equivalent modulo these conditions. Our main result is a general representation theorem in the spirit of Kraus, Lehmann and Magidor.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Theoretical Computer Science
Archive span
1975-2026
Indexed papers
16261
Paper id
621623823429198506
v2026.09.13