
arXiv: cs/0203002
The lexicographic closure of any given finite set D of normal defaults is defined. A conditional assertion "if a then b" is in this lexicographic closure if, given the defaults D and the fact a, one would conclude b. The lexicographic closure is essentially a rational extension of D, and of its rational closure, defined in a previous paper. It provides a logic of normal defaults that is different from the one proposed by R. Reiter and that is rich enough not to require the consideration of non-normal defaults. A large number of examples are provided to show that the lexicographic closure corresponds to the basic intuitions behind Reiter's logic of defaults.
Presented at Workshop on Logical Formalizations of Commense Sense, Austin (Texas), January 1993
FOS: Computer and information sciences, Logic in artificial intelligence, I.2.3, lexicograhic closure, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, Reiter's logic of defaults
FOS: Computer and information sciences, Logic in artificial intelligence, I.2.3, lexicograhic closure, Artificial Intelligence (cs.AI), Computer Science - Artificial Intelligence, Reiter's logic of defaults
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 127 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
