Subproblem finder and instance checker, two cooperating modules for theorem provers

Authors:
Dennis de Champeaux
Affiliations:
Univ. of Amsterdam, Amsterdam, The Netherlands
Venue:
Journal of the ACM (JACM)
Year:
1986

Citing 5
Cited 3

Realization of a geometry-theorem proving machine

Computers & thought
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Introduction to Mathematical Theory of Computation

Introduction to Mathematical Theory of Computation
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
Automated theorem proving: A logical basis (Fundamental studies in computer science)

Automated theorem proving: A logical basis (Fundamental studies in computer science)

Inference with path resolution and semantic graphs

Journal of the ACM (JACM)
Maintaining state constraints in relational databases: a proof theoretic basis

Journal of the ACM (JACM)
Consistent document engineering: formalizing type-safe consistency rules for heterogeneous repositories

Proceedings of the 2003 ACM symposium on Document engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Properties are proved about INSTANCE, a theorem prover module that recognizes that a formula is a special case and/or an alphabetic variant of another formula, and about INSURER, another theorem prover module that decomposes a problem, represented by a formula, into independent subproblems, using a conjunction. The main result of INSTANCE is soundness; the main result of INSURER is a maximum decomposition into subproblems (with some provisos). Experimental results show that a connection graph theorem prover extended with these modules is more effective than the resolution-based connection graph theorem prover alone.