Distance based revision of preferential logics
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.
This page was built for publication: Distance based revision of preferential logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4700535)
