A Circumscriptive Theorem Prover

Abstract In [6], a generalization of first-order logic was introduced that led to the development of an effective theorem prover for some simple sorts of default reasoning. In this paper, we show that these ideas can also be used to construct a theorem prover for a wide class of circumscriptive theories. The ideas to be discussed have been implemented, and the resulting system has been applied to the canonical birds flying example, to a non-separable circumscription [9], and to the Yale shooting problem. In all of these cases, the implementation returns the circumscriptively correct answer.

Authors

• Matthew L. Ginsberg

Keywords

No keywords are indexed for this paper.