Show simple item record

Explaining Updates by minimal sums

dc.contributor.authorDix, Juergenen_US
dc.contributor.authorSchlechta, Karlen_US
dc.description.abstractHuman reasoning about developments of the world involves always an assumption of \emph{inertia}. We discuss two approaches for formalizing such an assumption, based on the concept of an \emph{explanation}: \emph{(1)} there is a general preference relation given on the set of all explanations, \emph{(2)} there is a notion of a \emph{distance} between models and explanations are \emph{preferred} if their sum of distances is minimal. 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. Also cross-referenced as UMIACS-TR-99-47en_US
dc.format.extent619090 bytes
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-4051en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-99-47en_US
dc.titleExplaining Updates by minimal sumsen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record