Distance based revision of preferential logics (Q4700535)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1356641
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distance based revision of preferential logics |
scientific article; zbMATH DE number 1356641 |
Statements
Distance based revision of preferential logics (English)
0 references
19 December 1999
0 references
preferential logics
0 references
belief revision
0 references
distance semantics
0 references
revision of defeasible information
0 references
nonmonotonic databases
0 references
representation theorem for partial orders
0 references
0.806909441947937
0 references
0.7635820508003235
0 references
0.7616236805915833
0 references
0.7434313893318176
0 references
0.7431232333183289
0 references
The aim of the paper is to provide a formal theory of revision of defeasible information (e.g., nonmonotonic databases, logics). The starting point is the semantics of distance introduced by \textit{D. Lehmann, M. Magidor} and \textit{K. Schlechta} [Proc. Theoretical Aspects of Rationality and Knowledge, TARK'96, Morgan Kaufmann, 137-145 (1996)]. A preferential logic (or database), \(|\sim\), can be represented by a partial order. Given a distance on total orders, a revision of \(|\sim\) by a logic \(|\sim'\) is the logic corresponding to the partial order generated by the total orders extending the order of \(|\sim'\) which are closest to the set of total orders extending the order of \(|\sim\). Among others, the author discusses the problem of definability, consisting in that the set of the closest total orders, chosen in the process of revising, may not extend any partial order (in other words, the set may be undefinable by a partial order). The main result is a representation theorem for partial orders.
0 references