Building in equational theories into the connection method

  • Uwe Petermann
Part II Selected Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 535)


We consider possibilities of building in equational theories into a proof procedure based on the connection method.

The connection method has been enhanced by the following rules for equality reasoning: paramodulation, RUE-resolution and demodulation (all modulo a built in equational theory). Completeness results are proved for the two former rules. The considered procedures accept arbitrary first order formulas. The translation of improvements from one class of proof calculi (resolution) to another (connection method) contributes to a better understanding of the relations between different proof calculi.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ann70]
    Anderson R., Completeness results for E-resolution, In Proc. AFIP 70, Spring Joint Comp. Conf., AFIPS Press, Reston VA, pp 653–656, 1970.Google Scholar
  2. [Ans81]
    Andrews P., Theorem proving via general matings, J.ACM, 28, 193–214, 1981.Google Scholar
  3. [BB]
    K. H. Blaesius, H. J. Buerckert (Eds.), Deduction systems (in german), Oldenbourg-Verlag, Muenchen, Wien, 1987.Google Scholar
  4. [BG90]
    Bachmair L., Ganzinger H., On restrictions of ordered paramodulation with simplification, Proc. CADE 1990, pp. 427–441, 1990.Google Scholar
  5. [Bi82]
    Bibel W., Automated theorem proving, Verlag Vieweg, 1982, 2nd ed. 1987.Google Scholar
  6. [DEL90]
    Debart F., Enjalbert P., Lescot M., Multi modal logic programming using equational and order-sorted logic, Report, Lab. d'Informatique, Univ. de Caen, 1990.Google Scholar
  7. [DH86]
    Digricoli V. J., Harrison M. C., Equality-based binary resolution, J. ACM, Vol. 33, Nr. 2, April 1986, pp. 253–289.Google Scholar
  8. [JK90]
    Jouannaud J. P., Kirchner C., Solving equations in abstract algebras: a rule-based survey of unification, Report 561/1990, L.R.I., Univ. de Paris-Sud, 1990.Google Scholar
  9. [Mo69]
    Morris J. B., E-resolution: An extension of resolution to include the equality relation, In Proc. IJCAI 1969 (Washington D.C.), Walker D.E., Norton L.M., Eds., pp. 287–294, 1969.Google Scholar
  10. [Pe90a]
    Petermann U., Towards a connection procedure with built in theories, in Proc. JELIA 90, European Workshop on Logic in AI, Amsterdam Sept. 90, LNCS, Springer Publ., 1990.Google Scholar
  11. [Pe90b]
    Petermann U., Building in Theories into a first-order proof procedure based on the connection method, Preprint NTZ-Nr. 16/90, Naturwissenschaftlich — Theoretisches Zentrum and Department of Informatics, Leipzig University, 1990.Google Scholar
  12. [Prae90]
    Praecklein A., Solving equality reasoning problems with a connection graph theorem prover, SEKI-Report, SR-90-07, FB Informatik, Univ. Kaiserslautern, 1990.Google Scholar
  13. [Re87]
    Reichel H., Initial computability, algebraic specification and partial algbras, Oxford Univ. Press, 1987.Google Scholar
  14. [RW69]
    Robinson G., Wos L., Paramodulation and theorem proving in first-order theories with equality, Machine Intelligence, 4, 1969.Google Scholar
  15. [Sti85]
    Stickel M., Automated deduction by theory resolution, J. Autom. Reasoning, 1, 4 (1985), 333–356.Google Scholar
  16. [WRCS67]
    L.T. Wos, G.A. Robinson, D.F. Carson, L. Shalla, The concept of demodulation in theorem proving, J.ACM, Vol. 14, Nr. 4, Oct. 1967.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Uwe Petermann
    • 1
  1. 1.Dept. of InformaticsLeipzig UniversityLeipzigGermany

Personalised recommendations