The lexicographic closure as a revision process
| dc.creator | Booth, Richard | |
| dc.date | 2000-03-07 | |
| dc.date | 2000-03-08 | |
| dc.date.accessioned | 2026-07-07T03:15:57Z | |
| dc.date.available | 2026-07-07T03:15:57Z | |
| dc.description | The connections between nonmonotonic reasoning and belief revision are well-known. A central problem in the area of nonmonotonic reasoning is the problem of default entailment, i.e., when should an item of default information representing "if A is true then, normally, B is true" be said to follow from a given set of items of such information. Many answers to this question have been proposed but, surprisingly, virtually none have attempted any explicit connection to belief revision. The aim of this paper is to give an example of how such a connection can be made by showing how the lexicographic closure of a set of defaults may be conceptualised as a process of iterated revision by sets of sentences. Specifically we use the revision process of Nayak. | |
| dc.description | 7 pages, Nonmonotonic Reasoning Workshop 2000 (special session on belief change), at KR2000 | |
| dc.identifier | https://arxiv.org/abs/cs/0003017 | |
| dc.identifier | http://arxiv.org/abs/cs/0003017 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30179 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | Logic in Computer Science | |
| dc.subject | I.2.3 | |
| dc.title | The lexicographic closure as a revision process | |
| dc.type | text |