Minimal Belief and Negation as Failure (1994)
| Venue: | Artificial Intelligence |
| Citations: | 66 - 4 self |
BibTeX
@ARTICLE{Lifschitz94minimalbelief,
author = {Vladimir Lifschitz},
title = {Minimal Belief and Negation as Failure},
journal = {Artificial Intelligence},
year = {1994},
volume = {70},
pages = {53--72}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Fangzhen Lin and Yoav Shoham defined a propositional nonmonotonic logic which uses two independent modal operators. One of them represents minimal knowledge, the other is related to the ideas of justification (as understood in default logic) and of negation as failure. We describe a simplified version of that system, show how quantifiers can be included in it, and study its relation to circumscription and default logic, to logic programming, and to the theory of epistemic queries developed by Hector Levesque and Ray Reiter. 1 Introduction Lin and Shoham [16] defined a propositional nonmonotonic logic which uses two independent modal operators. One of them represents minimal knowledge, 1 the other is related to the ideas of justification (as understood in default logic) and of negation as failure. In this paper, we consider a special case of that system, in which Kripke structures of a particularly simple kind are used, and show how quantifiers can be included in it. This extension i...
