๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A circumscriptive theorem prover

โœ Scribed by Matthew L. Ginsberg

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
824 KB
Volume
39
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 nonseparable circumscription [9], and to the Yale shooting problem. In all of these cases, the implementation returns the circumscriptively correct answer.

๐Ÿ“œ SIMILAR VOLUMES

A full theorem-prover under uncertainty
A full theorem-prover under uncertainty
โœ G. Papakonstantinou; T. Panayiotopoulos ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 635 KB
A theorem on the consistency of circumsc
A theorem on the consistency of circumscription
โœ Peter L. Mott ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 536 KB

This paper giw's more general conditions under which McCarthy's circumscription is consistent, allowing application of the method outside the domain of universal sentences. It is shown that circumscription as presented here continues to correspond to the semantic model of minimization. Some applicat

An interpretation-oriented theorem prove
An interpretation-oriented theorem prover over integers
โœ James C. King; Robert W. Floyd ๐Ÿ“‚ Article ๐Ÿ“… 1972 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 744 KB

A special purpose theorem prover for establishing the validity of expressions over integer variables was developed as part of a program verifier. It is built around a powerful system for manipulating and simplifying integer expressions.