Skip to main content
SpringerLink
Log in

Universal unification and a classification of equational theories

  • Conference paper
  • First Online:
6th Conference on Automated Deduction (CADE 1982)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 138))

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L.D. Baxter, An Efficient Unification Algorithm, Univ. of Waterloo, Techn. Report CS-73-23, 1973

    Google Scholar 

  2. L.D. Baxter, The Undecidability of the Third Order Dyadic Unification Problem, Information and Control, vol 33, no 2, 1978

    Google Scholar 

  3. M. Davis, Hilbert's tenth Problem is unsolvable, Amer. Math. Monthly, vol 80, 1973

    Google Scholar 

  4. M. Fay, First Order Unification in an Equational Theory, Proc. 4th Workshop on Autom. Deduction, Texas, 1979

    Google Scholar 

  5. J.R. Guard, F.C. Oglesby, J.H. Benneth, L.G. Settle, Semi-Automated Mathematics, JACM 1969, vol 18, no 1

    Google Scholar 

  6. D. Goldfarb, The Undecidability of the Second Order Unification Problem, J. of Theor. Comp. Sci. 13, 1981

    Google Scholar 

  7. W.E. Gould, A Matching Procedure for ω-order Logic (thesis), Air Force Cambridge Research Labs, 1966

    Google Scholar 

  8. G. Grätzer, Universal Algebra, Springer Verlag, 1979

    Google Scholar 

  9. J. Herbrand, Recherches sour la theorie de la demonstration, Travaux de la Soc. des Sciences et des Lettres de Varsovie, no 33, 128, 1930

    Google Scholar 

  10. J. Hmelevskij, The Solution of certain Systems of Word Equations, Dok. Akad. Nauk SSSR (1964), (1966), (1967), (Soviet Math. Dokl.)

    Google Scholar 

  11. G. Huet, The Undecidability of Unification in Third Order Logic, Information and Control 22, 1973

    Google Scholar 

  12. G. Huet, Résolution d'équations dans des langages d'ordere 1,2,...,ω, Thèse d'Etat, Univ. de Paris, VII, 1976

    Google Scholar 

  13. G. Huet, A Unification Algorithms for Typed Lambda Calculus, J. Theoretic. Comp. Sci., 1, 1975

    Google Scholar 

  14. G. Huet, D.C. Oppen, Equations and Rewrite Rules, In “Formal Languages: Perspectives and Open Problems”, Ed. R. Book, Academic Press, 1980

    Google Scholar 

  15. G. Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems, JACM, vol 27, no 4, 1980

    Google Scholar 

  16. J.M. Hullot, Canonical Forms and Unification, Proc. of 5th Workshop on Automated Deduction, Springer Lecture Notes, 1980

    Google Scholar 

  17. J.M. Hullot, A Catalogue of Canonical Term Rewriting Systems, Research Rep. CSL-113, SRI-International, 1980

    Google Scholar 

  18. A. Herold, Universal Unification and extended regular ACFM Theories, Univ. Karlsruhe, 1982

    Google Scholar 

  19. D. Knuth, P. Bendix, Simple Word Problems in Universal Algebras, in: Comp. Problems in Abstract Algebra. J. Leech (ed), Pergamon Press, 1970

    Google Scholar 

  20. R. Kowalski, A Proof Procedure based on Connection Graphs, JACM, vol 22, no 4, 1975

    Google Scholar 

  21. D.S. Lankford, A Unification Algorithm for Abelian Group Theory, Rep. MTP-1, Louisiana Techn. Univ., 1979

    Google Scholar 

  22. D.S. Lankford, M. Ballantyne, The Refutation Completeness of Blocked Permutative Narrowing and Resolution, 4th Workshop on Autom. Deduction, Texas, 1979

    Google Scholar 

  23. M. Livesey, J. Siekmann, Termination and Decidability Results for Stringunification, Univ. of Essex, Memo CSM-12, 1975

    Google Scholar 

  24. M. Livesey, J. Siekmann, Unification of Sets and Multisets, Univ. Karlsruhe, Techn. Report, 1976

    Google Scholar 

  25. D. Loveland, Automated Theorem Proving, North Holland, 1980

    Google Scholar 

  26. G.S. Makanin, The Problem of Solvability of Equations in a Free Semigroup, Soviet Akad. Nauk SSSR, Tom 233, no 2, 1977

    Google Scholar 

  27. A. Martelli, U. Montaneri, An Efficient Unification Algorithm, University of Pisa, Techn. Report, 1979

    Google Scholar 

  28. Y. Matiyasevich, Diophantine Representation of Rec. Enumerable Predicates, Proc. of the Scand. Logic Symp., North Holland, 1978

    Google Scholar 

  29. N. Nilsson, Principles of Artificial Intelligence, Tioga Publ. Comp., California, 1980

    Google Scholar 

  30. M. Paterson, M. Wegman, Linear Unification, J. of Comp. and Syst. Science, 1978, 16

    Google Scholar 

  31. D. Prawitz, An Improved Proof Procedure, Theoria 26, 1960

    Google Scholar 

  32. G. Peterson, M. Stickel, Complete Sets of Reductions for Equational Theories with Complete Unification Algorithms, JACM, vol 28, no 2, 1981

    Google Scholar 

  33. G. Plotkin, Building in Equational Theories, Machine Intelligence, vol 7, 1972

    Google Scholar 

  34. P. Raulefs, J. Siekmann, Unification of Idempotent Functions, Universität Karlsruhe, 1978

    Google Scholar 

  35. P. Raulefs, J. Siekmann, P. Szabó, E. Unvericht, A short Survey on the State of the Art in Matching and Unification Problems, SIGSAM Bulletin, 13, 1979

    Google Scholar 

  36. J.A. Robinson, A Machine Oriented Logic based on the Resolution Principle, JACM 12, 1965

    Google Scholar 

  37. J.A. Robinson, Computational Logic: The Unification Computation, Machine Intelligence, vol 6, 1971

    Google Scholar 

  38. J. Siekmann, Stringunification, University of Essex, Memo CSM-7

    Google Scholar 

  39. J. Slagle, ATP for Theories with Simplifiers, Commutativity and Associativity, JACM 21, 1974

    Google Scholar 

  40. M. Stickel, A complete Unification Algorithm for assoc. commutative functions, Proc. of 4th IJCAL, Tbilisi, USSR, 1975

    Google Scholar 

  41. J. Siekmann, Unification of Commutative Terms (submitted),Universität Karlsruhe, 1982

    Google Scholar 

  42. P. Szabó, J. Siekmann, A Minimal Unification Algorithm for Idempotent Functions, Universität Karlsruhe, 1982 (forthcoming)

    Google Scholar 

  43. P. Szabó, J. Siekmann, Unification in Idempotent Semigroups (forthcoming), Universität Karlsruhe, 1982

    Google Scholar 

  44. P. Szabó, J. Siekmann, Universal Unification and a Classification of Equational Theories, Universität Karlsruhe, 1982 (full paper submitted)

    Google Scholar 

  45. P. Szabó, J. Siekmann, Universal Unification and Regular ACFM Theories, Proc. of IJCAI-81 (full paper submitted)

    Google Scholar 

  46. P. Szabó, The Undecidability of the DA-Unification Problem, Universität Karlsruhe, 1978

    Google Scholar 

  47. P. Szabó, Theory of First Order Unification (in German, thesis), Universität Karlsruhe, 1982

    Google Scholar 

  48. J. van Vaalen, An Extension of Unification to Substitutions with an Application to Automatic Theorem Proving, IJCAI-4, Proc. of 1975

    Google Scholar 

  49. E. Vogel Unifikationsalgorithmen für Morphismen, Universität Karlsruhe (in German, Diploma thesis), 1978

    Google Scholar 

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

    Google Scholar 

  51. L. Wos, G.A. Robinson, D. Carson, L. Shalla, The Concept of Demodulation in Theorem Proving, JACM, vol 14, no 4.

    Google Scholar 

  52. P. Szabó, J. Siekmann, A Noetherian and Confluent Rewrite System for Idempotent Semigroups, Semigroup Forum 1982

    Google Scholar 

  53. D. Lankford, A new complete FPA-Unification algorithm, Jan. 1980, MTP-8

    Google Scholar 

  54. F. Fages, private communication (to appear as INRIA report, France)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik I, University of Karlsruhe, Postfach 6380, D-7500, Karlsruhe 1, West Germany

    J. Siekmann & P. Szabó

Authors
  1. J. Siekmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Szabó
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

D. W. Loveland

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Siekmann, J., Szabó, P. (1982). Universal unification and a classification of equational theories. In: Loveland, D.W. (eds) 6th Conference on Automated Deduction. CADE 1982. Lecture Notes in Computer Science, vol 138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000071

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11558-8

  • Online ISBN: 978-3-540-39240-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation