Skip to main content

What You Always Wanted to Know about Rigid E-Unification

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

This paper solves an open problem posed by a number of researchers: the construction of a complete calculus for matrix-based methods with rigid E-unification. The use of rigid E-unification and simultaneous rigid E-unification for such methods was proposed by Gallier et al., in 1987. After our proof of the undecidability of simultaneous rigid E-unification in 1995. (Degtyarev and Voronkov, 1996d), it became clear that one should look for more refined techniques to deal with equality in matrix-based methods. In this article, we define a complete proof procedure for first-order logic with equality based on an incomplete but terminating procedure for rigid E-unification. Our approach is applicable to the connection method and the tableau method and is illustrated on the tableau method.

This is a preview of subscription content, access via your institution.

References

  1. Andrews, P. B.: Theorem proving via general matings, J. Association for Computing Machinery 28(2) (1981), 193–214.

    Google Scholar 

  2. Avron, A.: Gentzen-type systems, resolution and tableaux, J. Automated Reasoning 10 (1993), 256–281.

    Google Scholar 

  3. Bachmair, L., Ganzinger, H., Lynch, C. and Snyder, W.: Basic paramodulation and superposition, in D. Kapur (ed.), 11th Int. Conf. on Automated Deduction, LNAI 607, Springer-Verlag, Saratoga Springs, NY, U.S.A., 1992, pp. 462–476.

    Google Scholar 

  4. Bachmair, L., Ganzinger, H., Lynch, C. and Snyder, W.: Basic paramodulation, Information and Computation 121 (1995), 172–192.

    Google Scholar 

  5. Baumgartner, P.: An ordered theory resolution calculus, in A. Voronkov (ed.), Logic Programming and Automated Reasoning (LPAR'92), Lecture Notes in Computer Science 624, 1992, pp. 119–130.

  6. Baumgartner, P. and Furbach, U.: Consolution as a framework for comparing calculi, J. Symbolic Computations 16 (1993), 445–477.

    Google Scholar 

  7. Baumgartner, P. and Furbach, U.: PROTEIN: A PROver with a Theory Extension INterface, in A. Bundy (ed.), Automated Deduction – CADE-12. 12th Int. Conf. on Automated Deduction, LNAI 814, Nancy, France, 1994, pp. 769–773.

  8. Becher, G. and Petermann, U.: Rigid unification by completion and rigid paramodulation, in B. Nebel and L. Dreschler-Fischer (eds), KI-94: Advances in Artificial Intelligence. 18th German Annual Conference on Artificial Intelligence, LNAI 861, Springer-Verlag, Saarbrücken, Germany, 1994, pp, 319–330.

    Google Scholar 

  9. Beckert, B.: A completion-based method for mixed universal and rigid E-unification, in A. Bundy (ed.), Automated Deduction – CADE-12. 12th International Conference on Automated Deduction., LNAI 814, 678–692, Nancy, France, 1994, pp. 678–692.

  10. Beckert, B.: Are minimal solutions to simultaneous rigid E-unification sufficient for adding equality to semantic tableaux? Privately circulated manuscript, University of Karlsruhe, 1995.

  11. Beckert, B. and Hähnle, R.: An improved method for adding equality to free variable semantic tableaux, in D. Kapur (ed.), 11th International Conference on Automated Deduction (CADE), LNAI 607, Springer-Verlag, Saratoga Springs, NY, U.S.A., 1992, pp. 678–692.

    Google Scholar 

  12. Bibel, W.: On matrices with connections, J. Association for Computing Machinery 28(4) (1981), 633–645.

    Google Scholar 

  13. Bibel, W., Brü:uning, S., Egly, U., Korn, D. and Rath, T.: Issues in theorem proving based on the connection method, in P. Baumgartner, R. Hähnle, and J. Posegga (eds), Theorem Proving with Analytic Tableaux and Related Methods, LNAI No. 918, Schloß Rheinfels, St. Goar, Germany, 1995, pp. 1–16.

    Google Scholar 

  14. Brand, D.: Proving theorems with the modification method, SIAM J. Computing 4 (1975), 412–430.

    Google Scholar 

  15. Chang, C. L.: Theorem proving with variable-constrained resolution, Information Sciences 4 (1972), 217–231.

    Google Scholar 

  16. de Kogel, E.: Rigid E-unification simplified, in P. Baumgartner, R. Hähnle, and J. Posegga (eds), Theorem Proving with Analytic Tableaux and Related Methods, LNAI No. 918, Schloß Rheinfels, St. Goar, Germany, 1995, pp. 17–30.

    Google Scholar 

  17. Degtyarev, A. and Voronkov, A.: Equality elimination for semantic tableaux, UPMAIL Technical Report 90, Uppsala University, Computing Science Department, December 1994.

  18. Degtyarev, A. and Voronkov, A.: Equality elimination for the inverse method and extension procedures, in C. S. Mellish (ed.), Proc. International Joint Conference on Artificial Intelligence (IJCAI), Vol. 1, Montréal, 1995, pp. 342–347.

  19. Degtyarev, A. and Voronkov, A.: General connections via equality elimination, in M. De Glas and Z. Pawlak (eds), Second World Conference on the Fundamentals of Artificial Intelligence (WOCFAI-95), Angkor, Paris, 1995, pp. 109–120.

  20. Degtyarev, A. and Voronkov, A.: Decidability problems for the prenex fragment of intuitionistic logic, in Eleventh Annual IEEE Symposium on Logic in Computer Science (LICS'96), IEEE Computer Society Press, New Brunswick, NJ, 1996, pp. 503–512.

    Google Scholar 

  21. Degtyarev, A. and Voronkov, A.: Equality elimination for the tableau method, in J. Calmet and C. Limongelli (eds), Design and Implementation of Symbolic Computation Systems. International Symposium, DISCO'96, Lecture Notes in Computer Science 1128, Karlsruhe, Germany, 1996, pp. 46–60.

  22. Degtyarev, A. and Voronkov, A.: Handling equality in logic programs via basic folding, in R. Dyckhoff, H. Herre, and P. Schroeder-Heister (eds), Extensions of Logic Programming (5th International Workshop, ELP'96), Lecture Notes in Computer Science 1050, Leipzig, Germany, 1996, pp. 119–136.

  23. Degtyarev, A. and Voronkov, A.: Simultaneous rigid E-unification is undecidable, in H. Kleine Büning (ed.), Computer Science Logic. 9th International Workshop, CSL'95, Lecture Notes in Computer Science 1092, Paderborn, Germany, 1995, 1996, pp. 178–190.

  24. Degtyarev, A. and Voronkov, A.: The undecidability of simultaneous rigid E-unification, Theoretical Computer Science 166(1–2) (1996), 291–300.

    Google Scholar 

  25. Degtyarev, A. and Voronkov, A.: What you always wanted to know about rigid E-unification, in J. J. Alferes, L. M. Pereira and E. Orlowska (eds), Logics in Artificial Intelligence. European Workshop, JELIA'96, LNAI 1126, Évora, Portugal, 1996, pp. 50–69.

  26. Degtyarev, A. and Voronkov, A.: Equality reasoning and sequent-based methods, in A. Robinson and A. Voronkov (eds), Handbook of Automated Reasoning, Elsevier Science, 1998, to appear.

  27. Degtyarev, A., Gurevich, Yu. and Voronkov, A.: Herbrand's theorem and equational reasoning: Problems and solutions, in Bulletin of the European Association for Theoretical Computer Science, The 'Logic in Computer Science' column, Vol. 60, 1996, pp. 78–95.

    Google Scholar 

  28. Degtyarev, A., Matiyasevich, Yu. and Voronkov, A.: Simultaneous rigid E-unification and related algorithmic problems, in Eleventh Annual IEEE Symposium on Logic in Computer Science (LICS'96), IEEE Computer Society Press, New Brunswick, NJ, 1996, pp. 494–502.

    Google Scholar 

  29. Dershowitz, N.: Orderings for term rewriting systems, Theoretical Computer Science 17 (1982), 279–301.

    Google Scholar 

  30. Eder, E.: A comparison of the resolution calculus and the connection method, and a new calculus generalizing both methods, in E. Börger, G. Jäger, H. Kleine Büning, and M. M. Richter (eds), CSL'88 (Proc. 2nd Workshop on Computer Science Logic), Lecture Notes in Computer Science 385, Springer-Verlag, 1988, pp. 80–98.

  31. Eder, E.: Consolution and its relation with resolution, in Proc. International Joint Conference on Artificial Intelligence (IJCAI), 1991, pp. 132–136.

  32. Fitting, M.: First Order Logic and Automated Theorem Proving, Springer-Verlag, New York, 1990.

    Google Scholar 

  33. Gallier, J. H., Raatz S. and Snyder, W.: Theorem proving using rigid E-unification: Equational matings, in Proc. IEEE Conference on Logic in Computer Science (LICS), IEEE Computer Society Press, 1987, pp. 338–346.

  34. Gallier, J. H., Raatz, S. and Snyder, W.: Rigid E-unification and its applications to equational matings, in H. Aït Kaci and M. Nivat (eds), Resolution of Equations in Algebraic Structures Vol. 1, Academic Press, 1989, pp. 151–216.

  35. Gallier, J. H., Narendran, P., Plaisted, D. and Snyder, W.: Rigid E-unification is NP-complete, in Proc. IEEE Conference on Logic in Computer Science (LICS), IEEE Computer Society Press, 1988, pp. 338–346.

  36. Gallier, J., Narendran, P., Plaisted, D. and Snyder, W.: Rigid E-unification: NP-completeness and applications to equational matings, Information and Computation 87(1/2) (1990), 129–195.

    Google Scholar 

  37. Gallier, J., Narendran, P., Raatz, S. and Snyder, W.: Theorem proving using equational matings and rigid E-unification, J. the Association for Computing Machinery 39(2) (1992), 377–429.

    Google Scholar 

  38. Goubault, J.: A rule-based algorithm for rigid E-unification, in G. Gottlob, A. Leitsch and D. Mundici (eds), Computational Logic and Proof Theory. Proceedings of the Third Kurt Gödel Colloquium, KGC'93, Lecture Notes in Computer Science 713, Brno, 1993, pp. 202–210.

  39. Goubault, J.: Rigid E-unifiability is DEXPTIME-complete, in Proc. IEEE Conference on Logic in Computer Science (LICS), IEEE Computer Society Press, 1994.

  40. Hähnle, R., Beckert, B. and Gerberding, S.: The many-valued tableau-based theorem prover 3 T AP, Technical Report 30/94, Universität Karlsruhe, Fakultät für Informatik, 1994.

  41. Kanger, S.: A simplified proof method for elementary logic, in J. Siekmann and G. Wrightson (eds), Automation of Reasoning. Classical Papers on Computational Logic, Vol. 1, Springer Verlag, 1983, pp. 364–371, originally appeared in 1963.

  42. Kruskal, J.: Well quasi ordering, the tree problem and Vazsonyi's conjecture, Trans. Amer. Math. Soc. 95 (1960), 210–225.

    Google Scholar 

  43. Lee, R. C. T. and Chang, C. L.: Symbolic Logic and Mechanical Theorem Proving, Academic Press, 1973.

  44. Loveland, D. W.: Automated Theorem Proving: A Logical Basis, North Holland, 1978.

  45. Martin, U.: How to choose weights in the Knuth-Bendix ordering, in Rewriting Technics and Applications, Lecture Notes in Computer Science 256, 1987, pp. 42–53.

    Google Scholar 

  46. Maslov, S. Yu.: Invertible sequential variant of constructive predicate calculus (in Russian), Zapiski Nauchnyh Seminarov LOMI 4 (1967), 96–111. English translation in Seminars in Mathematics: Steklov Math. Inst. 4, Consultants Bureau, New York, London, 1969, pp. 36–42.

    Google Scholar 

  47. Matulis, V. A.: On variants of classical predicate calculus with the unique deduction tree (in Russian), Soviet Math. Dokl. 148 (1963), 768–770.

    Google Scholar 

  48. Mints, G.: Gentzen-type systems and resolution rules. Part I, Propositional logic, in P. Martin-Löf and G. Mints (eds), COLOG-88, Lecture Notes in Computer Science 417, Springer-Verlag, 1990, pp. 198–231.

  49. Moser, M., Lynch, C. and Steinbach, J.: Model elimination with basic ordered paramodulation, Technical Report AR–95-11, Fakultät für Informatik, Technische Universität München, München, 1995.

    Google Scholar 

  50. Nieuwenhuis, R.: Simple LPO constraint solving methods, Information Processing Letters 47 (1993), 65–69.

    Google Scholar 

  51. Nieuwenhuis, R. and Rubio, A.: Basic superposition is complete, in ESOP'92, Lecture Notes in Computer Science 582, Springer-Verlag, 1992, pp. 371–389.

  52. Nieuwenhuis, R. and Rubio, A.: Theorem proving with ordering and equality constrained clauses, J. Symbolic Computations 19 (1995), 321–351.

    Google Scholar 

  53. Norgela, S. A.: On the size of derivations under minus-normalization in Russian, in V. A. Smirnov (ed.), The Theory of Logical Inference, Institute of Philosophy, Moscow, 1974.

    Google Scholar 

  54. Petermann, U.: A complete connection calculus with rigid E-unification, in JELIA'94, Lecture Notes in Computer Science 838, 1994, pp. 152–166.

  55. Plaisted, D. A.: A simple non-termination test for the Knuth-Bendix method, in Proc. 8th CADE, Lecture Notes in Computer Science 230, 1986, pp. 79–88.

  56. Plaisted, D. A.: Special cases and substitutes for rigid E-unification, Technical Report MPI-I–95-2-010, Max-Planck-Institut für Informatik, 1995.

  57. Prawitz, D.: An improved proof procedure, in J. Siekmann and G. Wrightson (eds), Automation of Reasoning. Classical Papers on Computational Logic, Vol. 1, Springer-Verlag, 1983, pp. 162–201, originally appeared in 1960.

  58. Robinson, G. and Wos, L.: Paramodulation and theorem-proving in first order theories with equality, in B. Meltzer and D. Michie (eds), Machine Intelligence, Vol. 4, Edinburgh University Press, 1969, pp. 135–150.

  59. Schumann, J.: Tableau-based theorem provers: Systems and implementations, J. Automated Reasoning 13(3) (1994), 409–421.

    Google Scholar 

  60. Shostak, R.: An algorithm for reasoning about equality, Communications of the ACM 21 (1978), 583–585.

    Google Scholar 

  61. Smullyan, R. M.: First-Order Logic, Springer-Verlag, 1968.

  62. Veanes, M.: On Simultaneous Rigid E-Unification, PhD thesis, Uppsala University, 1997.

  63. Voronkov, A.: Proof search in intuitionistic logic with equality, or back to simultaneous rigid E-unification, in M. A. McRobbie and J. K. Slaney (eds), Automated Deduction – CADE-13, Lecture Notes in Computer Science 1104, New Brunswick, NJ, U.S.A., 1996, pp. 32–46. An extended version will appear in Journal of Automated Reasoning.

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Degtyarev, A., Voronkov, A. What You Always Wanted to Know about Rigid E-Unification. Journal of Automated Reasoning 20, 47–80 (1998). https://doi.org/10.1023/A:1005996623714

Download citation

  • tableau method
  • equality reasoning
  • rigid E-unification