Skip to main content
SpringerLink
Log in

Paramodulated connection graphs

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

The connection graph proof procedure of R. Kowalski is extended to the case of equality. The extension is achieved through the introduction of special links connecting those terms that can be paramodulated upon. Completeness and consistency of the resulting proof procedure are shown.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Boone, W.W.: The Word Problem. Ann. Math. 70, 207–265 (1959)

    Google Scholar 

  2. Brand, D.: Proving Theorems with the Modification Method. SIAM J. Comp. 4 (1975)

  3. Brown, F.M.: Notes on Chains and Connection Graphs. Personal Notes. Dept. Computational Logic, University of Edinburgh, 1976

  4. Bruynooghe, M.: The Inheritance of Links in a Connection Graph. Report CW7, Applied Mathematics and Programming Division, Katholieke Universiteit Leuven, 1975

  5. Daniels, S., Livesay, M., Mathis, C.H., Raulefs, P., Siekmann, J., Stephan, W., Unvericht, E., Wrightson, G.: Incorporating Mathematical Knowledge into an Automatic Theorem Proving System investigated for the Case of Automata Theory, I. Interner Bericht Nr. 6/77, Institut für Informatik I, Universität Karlsruhe, 1977

  6. Eisinger, N., Siekmann, J., Unvericht, E.: The Markgraf Karl Refutation Procedure. Interner Bericht, Institut für Informatik I, Universität Karlsruhe, 1979

  7. Kowalski, R.: Logic for Problem-Solving. Memo 75, University of Edinburgh, 1974

  8. Kowalski, R.: A Proof Procedure Using Connection Graphs. JACM 22 (1975)

  9. Ballantyne, A.M., Lankford, D.: Decision Procedures for Simple Equational Theories. University of Texas at Austin, ATP-35, ATP-37, ATP-39, 1977

  10. Richter, M.M.: A Note on Paramodulation and the Functional Reflexive Axioms. Institut für Informatik, Universität Aachen, Templergraben 35, 1975

  11. Robinson, G.A., Wos, L.: Paramodulation and Theorem Proving in First Order Theories with Equality. In: Machine Intelligence 4 (B. Meltzer and D. Michie, eds.), New York: American Elsevier 1969

    Google Scholar 

  12. Robinson, J.A.: A Machine-Oriented Logic Based on the Resolution Principle. JACM 12 (1965)

  13. Shostak, R.E.: Refutation Graphs. Journal of Artificial Intelligence 7 (1976)

  14. Sickel, S.: Clause Interconnectivity Graphs, IEEE Trans. on Computing, C-25 (1976)

  15. Siekmann, J., Stephan, W.: Completeness and Consistency of the Connection Graph Proof Procedure. Interner Bericht Nr. 7/76, Institut für Informatik I, Universität Karlsruhe, 1976

  16. Siekmann, J., Wrightson, G.: Paramodulated Connection Graphs. Interner Bericht Nr. 5/77, Institut für Informatik I, Universität Karlsruhe, 1977

  17. Waltz, D.L.: Generating Semantic Descriptions from Drawings of Scenes with Shadows. Ph. D., MIT, AI-Lab., 1972

  18. Wos, L., Robinson, G.: Maximal Models and Refutation Completeness: Semidecision Procedures in Automatic Theorem Proving. In: Wordproblems (W.W. Boone, F.B. Cannonito, R.C. Lyndon, eds.), North-Holland, 1973

  19. Yates, R.A., Raphael, B., Hart, T.P.: Resolution Graphs. Journal of Artificial Intelligence 1 (1970)

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik I, Universität Karlsruhe, D-7500, Karlsruhe 1, Federal Republic of Germany

    Jörg Siekmann & Graham Wrightson

Authors
  1. Jörg Siekmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Graham Wrightson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Siekmann, J., Wrightson, G. Paramodulated connection graphs. Acta Informatica 13, 67–86 (1980). https://doi.org/10.1007/BF00288537

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00288537

Keywords

Search

Navigation