A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
T his paper deals with computing circumscription in the case of Horn data with additional protection (indefinite data), an intermediate investigation between Reiter'sr esult on predicate completion and Lifschitz'se fforts to makeg eneral (formula) circumscription more efficient as a computational tool. Reiter has shown a close tie between McCarthy'sc ircumscription and Clark'sp redicate completion. Here we investigate a similar tie between an extended version of circumscription involvingdoi:10.1016/s0743-1066(85)80002-9 fatcat:pcspjcihtvcybdkayh6f2fm5ji