DMCA
Eliminating the fixed predicates from a circumscription (1989)
| Venue: | Artificial Intelligence |
| Citations: | 31 - 0 self |
BibTeX
@ARTICLE{Kleer89eliminatingthe,
author = {Johan De Kleer and Kurt Konolige},
title = {Eliminating the fixed predicates from a circumscription},
journal = {Artificial Intelligence},
year = {1989},
volume = {39}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Parallel predicate circumscription is the primary circumscriptive technique used in formalizing commonsense reasoning. In this paper we present a direct syntactic construction for transforming any parallel predicate circumscription usingfixed predicates into an equivalent one which does not. Thus, we show that predicate circumscription is no iiiore expressive with fixed predicates than without. We extend this result to prioritized circumscription. These results are expected to be usefulfor comparing circumscription to other nonmonotonic formalisms (such as autoepistemic logic and assumptionbased truth maintenance) and for implementing fixed predicates. Circumscription is one of the most well-developed formalizations of nonmonotonic reasoning. It exists in many variants, including domain cirdumscription [10], predicate circumscription [9], parallel predicate circumscription [9], formula circumscription [7], prioritized circumscription [4, 71. and pointwise circumscription [6]. All of these except the first and last are generalized by parallel predicate circumscription, which is currently the primary circumscriptive technique used in formalizing commonsense reasoning (see. for example,
Keyphrases
parallel predicate circumscription primary circumscriptive technique predicate circumscription domain cirdumscription nonmonotonic reasoning pointwise circumscription nonmonotonic formalism well-developed formalization formula circumscription commonsense reasoning fixed predicate autoepistemic logic truth maintenance direct syntactic construction many variant
