Preferred history semantics for iterated updates

DOI10.1093/LOGCOM/9.6.817MaRDI QIDQ4943501zbMATH OpenOpenAlexFDO

Authors Shai Berger, Daniel Lehmann, K. Schlechta

Publication date 31 July 2000

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0202026

zbMATH Keywords

knowledge representationpreference relationrevisioniterated update

Mathematics Subject Classification ID

Knowledge representation (68T30) Logics of knowledge and belief (including belief change) (03B42)

Abstract: We give a semantics to iterated update by a preference relation on possible developments. An iterated update is a sequence of formulas, giving (incomplete) information about successive states of the world. A development is a sequence of models, describing a possible trajectory through time. We assume a principle of inertia and prefer those developments, which are compatible with the information, and avoid unnecessary changes. The logical properties of the updates defined in this way are considered, and a representation result is proved.

Recommendations

• A history based logic for dynamic preference updates
• Euro-Par 2004 Parallel Processing
• Defaults in update semantics
• Semantics of concurrent revisions
• Reasoning about optimistic concurrency using a program logic for history
• scientific article; zbMATH DE number 1785001
• scientific article; zbMATH DE number 1304366
• Revising and updating using a back-up semantics

Cited in

(5)

• Distance semantics for belief revision
• Belief extrapolation (or how to reason about observations and unpredicted change)
• Reasoning about action and change
• A history based logic for dynamic preference updates
• Explaining updates by minimal sums

This page was built for publication: Preferred history semantics for iterated updates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943501)