Proving Theorems with the Modification Method

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1975 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Computing, volume 4, pages 412-430 (issn: 0097-5397, eissn: 1095-7111,

Copyright policy )

Authors: Daniel Brand;

doi: 10.1137/0204036

Proving Theorems with the Modification Method

- Summary
- Subjects
- Metrics

Abstract

A method for proving theorems in first order predicate calculus theories with equality is described and proven complete. Completeness of this “Modification Method” implies completeness of Paramodulation without the functionally reflexive axioms, thus proving a conjecture of Wos and Robinson (1969). Moreover, completeness holds with some other restrictions, such as limiting paramodulation into variables. Experimental results using the Modification Method are included.

Keywords

Classical first-order logic, Theorem proving (deduction, resolution, etc.)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	101
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average