A Second-Order Theorem Prover Applied to Circumscription

Authors:
Michael Beeson
Affiliations:
-
Venue:
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Year:
2001

Citing 8
Cited 0

An algorithm to compute circumscription

Artificial Intelligence
A circumscriptive theorem prover

Artificial Intelligence
Some applications of Gentzen's proof theory in automated deduction

Proceedings of the international workshop on Extensions of logic programming
Automatic derivation of the irrationality of e

Journal of Symbolic Computation - Calculemus-99: integrating computation and deduction
Computing Circumscription Revisited: A Reduction Algorithm

Journal of Automated Reasoning
Automatic Generation of Epsilon-Delta Proofs of Continuity

AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
Unification in Lambda-Calculi with if-then-else

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Computing circumscription

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Circumscription is naturally expressed in second-order logic, but previous implementations all work by handling cases that can be reduced to first-order logic. Making use of a new second-order unification algorithm introduced in [3], we show how a theorem prover can be made to find proofs in second-order logic, in particular proofs by circumscription. We work out a blocks-world example in complete detail and give the output of an implementation, demonstrating that it works as claimed.