An efficient method for eliminating varying predicates from a circumscription

✍ Scribed by Marco Cadoli; Thomas Eiter; Georg Gottlob

• Publisher: Elsevier Science
• Year: 1992
• Tongue: English
• Weight: 641 KB
• Volume: 54
• Category: Article
• ISSN: 0004-3702
• DOI: 10.1016/0004-3702(92)90051-x

✦ Synopsis

Cadoli, M., T. Eiter and G. Gottlob, An efficient method for eliminating varying predicates from a circumscription, Artificial Intelligence 54 (1992) 397-410.

Circumscription appears to be the most powerful and well-studied technique used in formalizing common-sense reasoning. The general form of predicate circumscription allows for fixed and varying (floating) predicates. We show that the inference problem under this form of circumscription is efficiently reducible to inferencing under circumscription without varying predicates. In fact, we transform this problem even into circumscription without fixed and varying predicates, that is where all predicates are minimized. Thus any theorem prover or algorithm for inferencing under circumscription without fixed and varying predicates is able to handle inferencing under the general form of predicate circumscription. As a consequence, algorithms that compute circumscription for an inference task can be simplified.