A new class of theories for which circumscription can be obtained via the predicate completion

Document Type

Article

Publication Date

4-1-1996

Abstract

Computing circumscription of a first-order theory is difficult because it involves, in general, a second-order quantifier. It is therefore important to study the cases where the circumscription can be expressed as a first-order theory. Lifschitz and Rabinov have previously shown that the class of separable theories and the class of collapsible theories have this property. Here, we introduce a new class of theories δ, called finitary theories, for which the circumscription CIRC(δ, P, Q) is given by a first order theory δ ∪ δpc, where δpc is the set of predicate completion formulas for predicates in P defined in a suitable way. There are many finitary theories which are interesting and which do not belong to the class of separable or collapsible theories. © 1996 Taylor & Francis Group, LLC.

Publication Source (Journal or Book title)

Journal of Experimental and Theoretical Artificial Intelligence

First Page

191

Last Page

205

This document is currently not available here.

Share

COinS