dc.contributor.author | Dix, Juergen | en_US |
dc.contributor.author | Schlechta, Karl | en_US |
dc.date.accessioned | 2004-05-31T22:58:48Z | |
dc.date.available | 2004-05-31T22:58:48Z | |
dc.date.created | 1999-09 | en_US |
dc.date.issued | 1999-09-11 | en_US |
dc.identifier.uri | http://hdl.handle.net/1903/1023 | |
dc.description.abstract | Human 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-47 | en_US |
dc.format.extent | 619090 bytes | |
dc.format.mimetype | application/postscript | |
dc.language.iso | en_US | |
dc.relation.ispartofseries | UM Computer Science Department; CS-TR-4051 | en_US |
dc.relation.ispartofseries | UMIACS; UMIACS-TR-99-47 | en_US |
dc.title | Explaining Updates by minimal sums | en_US |
dc.type | Technical Report | en_US |
dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |