article

Free access

An Implementation of the Model Elimination Proof Procedure

Authors:

S. Fleisig,

D. Loveland,

A. K. Smiley, III,

D. L. YarmushAuthors Info & Claims

Journal of the ACM (JACM), Volume 21, Issue 1

Pages 124 - 139

https://doi.org/10.1145/321796.321807

Published: 01 January 1974 Publication History

PDF eReader

Abstract

The model elimination (ME) and resolution algorithms for mechanical theorem-proving were implemented so as to maximize shared features. The identical data structures and large amount of common programming permit meaningful comparisons when the two programs are run on standard problems. ME does better on some classes of problems, and resolution better on others. The depth-first search strategy used in this ME implementation affects the performance profoundly. Other novel features in the implementation are new control parameters to govern extensions, and modified rules for generating and rejecting chains. The resolution program incorporates unit preference and set-of-support. An appendix reproduces the steps of a machine-derived ME refutation.

References

[1]

FRIEDMAN, J. A semi-decision procedure for the functional calculus. J. ACM 10, 1 (Jan. 1963), 1-24.

Crossref

Google Scholar

[2]

GLASNER, J., OCKEN, S., ROS~NBERG, D., SCHWARTZ, J., SHAPIRO, G., AND SILVERMAS, A. The Nu-Speak System. NYU Rep., NYO-1480-9 (Nov. 1964), 107 pp.

Google Scholar

[3]

KOWALSKI, R., AND KUF.HNER, D. Linear resolution with selection function. Artif. lntell. 2 (1971), 227-260.

Google Scholar

[4]

LOVELAND, D.W. Mechanical theorem-proving by model elimination. J. ACM 15, 2 (April 1968), 236-251.

Crossref

Google Scholar

[5]

LOVELAND, D.W. A simplified format for the model elimination theorem-proving procedure. J. ACM 16, 3 (july 1969), 349-363.

Crossref

Google Scholar

[6]

LOVELAND, D.W. Theorem proving combining model elimination and resolution. In Machine Intelligence $, B. Meltzer and D. Michie, Eds., Edinburgh U. Press, Edinburgh, 1969, pp. 73-86.

Google Scholar

[7]

LOW:LAND, D.W. A unifying view of some linear Herbrand procedures. J. ACM 19, 2 (April 1972), 366-384.

Crossref

Google Scholar

[8]

LUCKH:.M, D. Some tree-pairing strategies for theorem-proviug. In Machine In~~Zligence ~, E. Dale and D. Meltzer, Eds., Oliver and Boyd, Edinburgh, 1968, pp. 95-112.

Google Scholar

[9]

ROBINSON, J. A. A machine-oriented logic based on the resolution principle. J. ACM 12, 1 (Jan. 1965), 23-41.

Crossref

Google Scholar

[10]

Wos, L., CARSON, D. F., AND ROBINSON, G.A. The unit preference strategy in theorem proving. Proc. AFIPS 1964 FJCC, Vol. 26, Spartan Books, New York, pp. 615-621.

Google Scholar

[11]

Wos, L., ROBINSON, G. A., AND CAaSON, D.F. Efficiency and completeness of the set of support strategy in theorem proving. J. ACM I2, 4 (Oct. 1965), 536-541.

Crossref

Google Scholar

[12]

Wos, L., ROBINSON, G. A., CARSON, D. F., AND SHALLA, L. The concept of demodulation in theorem proving. J. ACM 14, 4 (Oct. 1967), 698-709.

Crossref

Google Scholar

Cited By

View all

Davis M(2020)Seventy Years of Computer ScienceFields of Logic and Computation III10.1007/978-3-030-48006-6_8(105-117)Online publication date: 23-May-2020
https://doi.org/10.1007/978-3-030-48006-6_8
Astrachan OStickel M(2005)Caching and lemmaizing in model elimination theorem proversAutomated Deduction—CADE-1110.1007/3-540-55602-8_168(224-238)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-55602-8_168
Neiman V(2005)On the problem of reducing search in logic program executionCOLOG-8810.1007/3-540-52335-9_56(232-241)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-52335-9_56
Show More Cited By

Index Terms

An Implementation of the Model Elimination Proof Procedure
1. Computing methodologies
  1. Artificial intelligence
    1. Knowledge representation and reasoning
  2. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
      1. Theorem proving algorithms
2. Theory of computation
  1. Logic
    1. Proof theory

Recommendations

Cut-Elimination and Proof Schemata
Revised Selected Papers of the 10th International Tbilisi Symposium on Logic, Language, and Computation - Volume 8984

By Gentzen's famous Hauptsatz the cut-elimination theorem every proof in sequent calculus for first-order logic with cuts can be transformed into a cut-free proof; cut-free proofs are analytic and consist entirely of syntactic material of the end-...
A proof-search procedure for intuitionistic propositional logic
Abstract
A sequent root-first proof-search procedure for intuitionistic propositional logic is presented. The procedure is obtained from modified intuitionistic multi-succedent and classical sequent calculi, making use of Glivenko’s Theorem. We prove that ...
An isomorphism between cut-elimination procedure and proof reduction
TLCA'07: Proceedings of the 8th international conference on Typed lambda calculi and applications

This paper introduces a cut-elimination procedure of the intuitionistic sequent calculus and shows that it is isomorphic to the proof reduction of the intuitionistic natural deduction with general elimination and explicit substitution. It also proves ...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 21, Issue 1

Jan. 1974

176 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/321796

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1974

Published in JACM Volume 21, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

30
Total Citations
View Citations
459
Total Downloads

Downloads (Last 12 months)41
Downloads (Last 6 weeks)8

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Davis M(2020)Seventy Years of Computer ScienceFields of Logic and Computation III10.1007/978-3-030-48006-6_8(105-117)Online publication date: 23-May-2020
https://doi.org/10.1007/978-3-030-48006-6_8
Astrachan OStickel M(2005)Caching and lemmaizing in model elimination theorem proversAutomated Deduction—CADE-1110.1007/3-540-55602-8_168(224-238)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-55602-8_168
Neiman V(2005)On the problem of reducing search in logic program executionCOLOG-8810.1007/3-540-52335-9_56(232-241)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-52335-9_56
Stickel M(2005)A prolog technology theorem prover: Implementation by an extended prolog compiler8th International Conference on Automated Deduction10.1007/3-540-16780-3_122(573-587)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-16780-3_122
Okushi FVan Gelder A(2004)Persistent and Quasi-Persistent Lemmas in Propositional Model EliminationAnnals of Mathematics and Artificial Intelligence10.1023/B:AMAI.0000012873.60775.ba40:3-4(373-401)Online publication date: 1-Mar-2004
https://dl.acm.org/doi/10.1023/B%3AAMAI.0000012873.60775.ba
Benedetti M(2001)Conditional Pure Literal GraphsProceedings of the First International Joint Conference on Automated Reasoning10.5555/648237.753959(331-346)Online publication date: 18-Jun-2001
https://dl.acm.org/doi/10.5555/648237.753959
Bonacina M(2001)A Taxonomy of Theorem-Proving StrategiesArtificial Intelligence Today10.1007/3-540-48317-9_3(43-84)Online publication date: 11-May-2001
https://doi.org/10.1007/3-540-48317-9_3
Benedetti M(2001)Conditional Pure Literal GraphsAutomated Reasoning10.1007/3-540-45744-5_25(331-346)Online publication date: 8-Jun-2001
https://doi.org/10.1007/3-540-45744-5_25
Bonacina M(1999)A taxonomy of theorem-proving strategiesArtificial intelligence today10.5555/1805750.1805753(43-84)Online publication date: 1-Jan-1999
https://dl.acm.org/doi/10.5555/1805750.1805753
Formisano APolicriti A(1999)T-ResolutionJournal of Automated Reasoning10.1023/A:100617051417422:4(433-483)Online publication date: 1-May-1999
https://dl.acm.org/doi/10.1023/A%3A1006170514174
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Cut-Elimination and Proof Schemata

A proof-search procedure for intuitionistic propositional logic

An isomorphism between cut-elimination procedure and proof reduction

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations