Skip to main content
SpringerLink
Log in

Universal Unification

  • Conference paper
GWAI-82

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 58))

Abstract

This article surveys what is presently known about first order unification theory.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. A. Ballantyne, D. Lankford:‘Decision Procedures for simple equational theories’, University of Texas at Austin, ATP-35, ATP-37, ATP-39, 1977

    Google Scholar 

  2. Barrow, Ambler, Burstall: ‘Some techniques for recognizing Structures in Pictures’, Frontiers of Pattern Recognition, Academic Press Inc., 1972

    Google Scholar 

  3. L.D. Baxter: ‘An efficient Unification Algorithm’, Rep. CS-73–23, University of Waterloo, Dept. of Analysis and Computer Science, 1973

    Google Scholar 

  4. F. Blair et al: ‘SCRATCHPAD/1: An interactive facility for symbolic mathematics’, Proc. of the 2nd Symposium on Symbolic Manipulation, Los Angeles, 1971

    Google Scholar 

  5. D.G. Bobrow (ed): ‘Symbol Manipulation Languages’, Proc. of IFIP, North Holland Publishing Comp., 1968

    MATH  Google Scholar 

  6. H.P. Böhm, H.L. Fischer, P. Raulefs: ‘CSSA: Language Concepts and Programming Methodology’, Proc. of ACM, SIGPLAN/ART Conference, Rochester, 1977

    Google Scholar 

  7. H. Boley: ‘Directed Recursive Labelnode Hypergraphs: A New Representation Language’, Journal of Artificial Intelligence, vol 9, no. 1, 1977

    Google Scholar 

  8. H. Bryan, J. Carnog: ‘Search methods used with transistor patent applications’, IEEE Spectrum 3, 2, 1966

    Google Scholar 

  9. L.D. Baxter: ‘The Undecidability of the Third Order Dyadic Unification Problem’,Information and Control, vol 38, no. 2, 1978

    Google Scholar 

  10. R. Boyer, J.S. Moore: ‘A Fast String Searching Algorithm’, CACM vol 20, no. 10, 1977

    Google Scholar 

  11. Caviness: ‘On Canonical Form and Simplification’, JACM, vol 17, no. 2, 1970

    Google Scholar 

  12. C. Christensen, M. Karr: ‘IAM, a Symstem for interactive algebraic Manipulation’, Proc. of the 2nd Symposium on Symbolic Manipulation, Los Angeles, 1971

    Google Scholar 

  13. M. Clowes: ‘On Seeing Things’ Journal of Artificial Intelligence, 1971

    Google Scholar 

  14. CODASYL Systems Committee: ‘A survey of Generalized Data Base Management Systems’, Techn. Rep. 1969, ACM and IAG

    Google Scholar 

  15. CODASYL Systems Committee: ‘Feature Analysis of Generalized Data Base Management Systems’, TR 1971, ACM, BC and IAG

    Google Scholar 

  16. E.F. Codd: ‘A Relational Model of Data for Large shared Data-banks’, CACM, 13, 6, 1970

    Google Scholar 

  17. E.F. Codd: ‘Relational Completeness of Data Base Sublanguages’, in Data Base Systems, Prentice Hall, Courant Comp. Science Symposia Series, vol 6, 1972

    Google Scholar 

  18. Cook: ‘Algebraic techniques and the mechanization of number theory’, RM-4319-PR, Rand Corp., Santa Monica, Cal., 1965

    Google Scholar 

  19. D.G. Corneil: ‘Graph Isomorphism’, Ph. D. Dept. of Computer Science, University of Toronto, 1968

    Google Scholar 

  20. W. Clocksin, C. Mellish: Programming in PROLOG, Springer 1981

    MATH  Google Scholar 

  21. A. Clifford, G. Preston: ‘The Algebraic Theory of Semigroups’, vol I and vol II, 1961

    MATH  Google Scholar 

  22. J.L. Darlington: ‘A partial Mechanization of Second Order Logic’, Mach. Int. 6, 1971

    Google Scholar 

  23. C.J. Date: ‘An Introduction to Database Systems’, Addison-Wesley Publ. Comp. Inc., 1976

    Google Scholar 

  24. M. Davis: ‘Hilpert’s tenth Problem is unsolvable’, Amer. Math. Monthly, vol 80, 1973

    Google Scholar 

  25. R. Fateman: ‘The User-Level Semantic Matching Capability in MACSYMA’, Proc. of the 2nd Symposium on Symbolic Manipulation, Los Angeles, 1971

    Google Scholar 

  26. D.J. Farber, R.E. Griswald, I.P. Polonsky: ‘SNOBOL as String Manipulation Language’, JACM, vol 11, no. 2, 1964

    Google Scholar 

  27. J. Fischer, S. Patterson: ‘String Matching and other Products’, MIT, Project MAC, Report 41, 1974

    Google Scholar 

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

    Google Scholar 

  29. F. Fages: ‘Private Communication’ (to appear as INRIA report, France), 1981

    Google Scholar 

  30. J.F. Gimpel: A Theory of Discrete Patterns and their Implementation in SNOBOL4, CACM 16, 2, 1973

    MathSciNet  Google Scholar 

  31. W.E. Gould: ‘A matching procedure for ω-order logic’, Scientific report no. 4, Air Force Cambridge Research Labs., 1966

    Google Scholar 

  32. J.R. Guard: Automated logic for semi-automated mathematics, Scientific report no. 1, Air Force Cambridge Research Labs., AD 602 710, 1964

    Google Scholar 

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

    Google Scholar 

  34. D. Goldfarb: ‘The Undecidability of the Second Order Unification Problem’, Journal of Theor. Comp. Sci., 13, 1981

    Google Scholar 

  35. G. Grätzer: ‘Universal Algebra’, Springer Verlag, 1979

    MATH  Google Scholar 

  36. H. Gallaire, J. Minker: ‘Logic and Databases’, Plenum Press, 1978

    Google Scholar 

  37. 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 

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

    Google Scholar 

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

    Google Scholar 

  40. G. Huet: ‘Confluent Reductions: Abstract Properties and Applications to Term Rewriting Symstems’, JACM, vol 27, no.4, 1980

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  43. A. Herold: ‘Universal Unification and a Class of Equational Theories’, Proc. GWAI-82, W. Wahlster (ed) Springer Fachbe-richte, 1982

    Google Scholar 

  44. J. Howie: ‘Introduction to Semigroup Theory’,Acad. Press, 1976

    MATH  Google Scholar 

  45. A. Hearn: ‘REDUCE2, A System and Language for Algebraic Manipulation’, Proc. of the 2nd Symposium on Symbolic Mani-pulation, Los Angeles, 1971

    Google Scholar 

  46. S. Heilbrunner: ‘Gleichungssysteme für Zeichenreihen’, TU München, Abtl. Mathematik, Ber. Nr. 7311, 1973

    Google Scholar 

  47. C. Hewitt: ‘Description and Theoretical analysis of PLANNER a language for proving theorems and manipulating models in a robot’, Dept. of Mathematics, Ph. C. Thesis, MIT, 1972

    Google Scholar 

  48. C. Hewitt: ‘Viewing Control Structures as Patterns of Passing Massages’, MIT, AI-Lab., Working paper 92, 1976

    Google Scholar 

  49. J.I. Hmelevskij: ‘The solution of certain systems of word equations’, Dokl. Akad. Nauk SSSR, 1964, 749 Soviet Math. Dokl.5, 1964, 724

    Google Scholar 

  50. J.I. Hmelevskij: ‘Word equations without coefficients’, Dokl. Acad. Nauk. SSSR 171, 1966, 1047 Soviet Math. Dokl. 7, 1966, 1611

    Google Scholar 

  51. J.I. Hmelevskij: ‘Solution of word equations in three unknowns’, Dokl. Akad. Nauk. SSSR 177, 1967, no. 5, Soviet Math. Dokl. 8, 1967, no. 6

    Google Scholar 

  52. G.P. Huet: ‘Constrained resolution: a complete method for theory’, Jenning’s Computing Centre rep. 1117, Case Western Reserve Univ., 1972

    Google Scholar 

  53. G.P. Huet: ‘The undecidability of unification in third order logic’, Information and Control 22 (3), 257–267, 1973

    Article  MathSciNet  MATH  Google Scholar 

  54. G. Huet: ‘Unification in typed Lambda Calculus’, in λ-Calculus and Comp. Sci. Theory, Springer Lecture Notes, No. 37, Proc. of the Symp. held in Rome, 1975

    Google Scholar 

  55. G.P. Huet: ‘A Unification Algorithm for typed λ-Calculus’, J. Theor. Comp. Sci., 1, 1975

    Google Scholar 

  56. D. Jensen, T.Pietrzykowski: ‘Mechanising ω-order type theory through unification’, Rep. CS73-16, Dept. of Applied Analysis and Comp. Sci. University of Waterloo, 1973

    Google Scholar 

  57. Karp, Miller, Rosenberg: ‘Rapid Identification of repeated Patterns in Strings, Trees and Arrays’, ACM Symposium on Th. of Comp. 4, 1972

    Google Scholar 

  58. D.E. Knuth, P.B. Bendix: ‘Simple word Problems in Unviersal Algebras’, in: Computational Problems in Abstract Algebra, J. Leech (ed), Pergamon Press, Oxford, 1970

    Google Scholar 

  59. Knuth, Morris, Pratt: ‘Fast Pattern Matching in Strings’, Stan-CS-74-44O, Stanford University, Comp. Sci. Dept., 1974

    Google Scholar 

  60. S. Kühner, Ch. Mathis, P. Raulefs, J. Siekmann: ‘Unification of Ideitipotent Functions’, Proceedings of fourth IJCAI, MIT, Cambridge, 1977

    Google Scholar 

  61. R. Kowalski: ‘Logic for Problem Solving’, North Holland, 1979

    MATH  Google Scholar 

  62. D. Kapur, M.S. Krishnamoorthy, P. Narendran: ‘A new linear Algorithm for Unification’, General Electric, Rep. no. 82CRD-1oo, New York, 1982

    Google Scholar 

  63. G. Levi, F. Sirovich: ‘Pattern Matching and Goal directed Computation’, Nota Interna B73-12, Univ. of Pisa, 1973

    Google Scholar 

  64. C.L. Lucchesi: ‘The undecidability of the unification problem for third order languages’, Rep. CSRR 2059, Dept. of Applied Analysis and Comp. Science, Univ. of Waterloo, 1972

    Google Scholar 

  65. D.S. Lankford: ‘A new complete FPA-Unification Algorithm’, MIT-8, Louisiana Techn. Univ., 1980

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  69. M. Livesey, J. Siekmann: ‘Unification of Sets and Multisets’, Univ. Karlsruhe, Techn. Report, 1976

    Google Scholar 

  70. D. Loveland: ‘Automated Theorem Proving’, North Holland, 1980

    Google Scholar 

  71. M. Livesey, J. Siekmann, P. Szabó, E. Unvericht: ‘Unification Problems for Combinations of Associativity, Commutativity, Distributivity and Idempotence Axioms’, Proc. of Conf. on Autom. Deduction, Austin, Texas, 1979

    Google Scholar 

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

    Google Scholar 

  73. A. Martelli, U. Montaneri: ‘An Efficient Unification Algorithm’, University of Pisa, Techn. Report, 1979

    Google Scholar 

  74. Y. Matiyasevich: ‘Diophantine Representation of Rec. Enumerable Predicates’, Proc. of the Scand. Logic Symp., North Holland, 1978

    Google Scholar 

  75. Manove, Bloom, Engelmann: ‘Rational Functions in MATHLAB’, IFIP Conf. on Symb. Manipulation, Pisa, 1968

    Google Scholar 

  76. A.A. Markov: ‘Trudy Mat. Inst. Steklov’, no. 42, Izdat. Akad. Nauk SSSR, 1954, NR 17, 1038, 1954

    Google Scholar 

  77. Maurer: ‘Graphs as Strings’, Universität Karlsruhe, Techn. Rep., 1977

    Google Scholar 

  78. J. Moses: Symbolic Integration: ‘The Stormy Decade’, CACM 14, 8, 1971

    Google Scholar 

  79. J. Moses: ‘MACSYMA -the fifth Year’, Project MAC, MIT, Cambridge, 1974

    Google Scholar 

  80. N. Nilsson: ‘Principles of Artificial Intelligence’, Tioga Publ. Comp., Cal., 1980

    MATH  Google Scholar 

  81. A. Nevins: ‘A Human oriented logic for ATP’, JACM 21, 1974 (first report 1971)

    Google Scholar 

  82. M. Paterson, M. Wegman: ‘Linear Unification’, J. of Comp. and Syst. Science, 1968, 16

    Google Scholar 

  83. D. Prawitz: ‘An Improved Proof Procedure’, Theoria 26, 1960

    Google Scholar 

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

    Google Scholar 

  85. G. Plotkin: ‘Building in Equational Theories’, Machine Intelligence, vol 7, 1972

    Google Scholar 

  86. P. Raulefs, J. Siekmann: ‘Unification of Idempotent Functions’, Universität Karlsruhe, Techn. Report, 1978

    Google Scholar 

  87. 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 

  88. J.A. Robinson: ‘A Machine Oriented Logic based on the Resolution Principle’, JACM 12, 1965

    Google Scholar 

  89. J.A. Robinson: ‘Computational Logic: The Unification Compu-tation’, Machine Intelligence, vol 6, 1971

    Google Scholar 

  90. J. Rastall: ‘Graph-family Matching’, Univers. of Edinburgh, MIP-R-62, 1969

    Google Scholar 

  91. J.A. Robinson: ‘A review on automatic theorem proving’, Symp. Appl. Math., vol 19, 1–18, 1967

    Google Scholar 

  92. Rulifson, Derksen, Waldinger: ‘QA4: A procedural calculus for intuitive reasoning’, Stanford Univ., Nov. 1972

    Google Scholar 

  93. J. Siekmann: ‘Stringunification’ Essex University, Memo CSM-7, 1975

    Google Scholar 

  94. J. Siekmann: ‘Unification of Commutative Terms’, Universität Karlsruhe, 1976 (full paper submitted)

    Google Scholar 

  95. J. Siekmann: ‘Unification and Matching Problems’, Ph.D., Essex University, MEMO CSM-4-78

    Google Scholar 

  96. J. Siekmann, P. Szabó: ‘Universal Unification and Regular ACFM Theories’, Proc. IJCAI-81, Vancouver, 1981 (full paper submitted)

    Google Scholar 

  97. J. Siekmann, P. Szabó: ‘A Noetherian and Confluent Rewrite System for Idempotent Semigroups’, Semigroup Forum, vol 25, 1982

    Google Scholar 

  98. J. Siekmann, P. Szabó: ‘Universal Unification and a Classific-ation of Equational Theories’, Proc. of Conf. on Autom. Deduction, 1982, New York, Springer Lecture Notes Comp. Sci., vol 87 (full paper submitted)

    Google Scholar 

  99. J. Siekmann, P. Szabó: ‘A Minimal Unification Algorithm for Idempotent Functions’, Universität Karlsruhe, 1982 (in preparation)

    Google Scholar 

  100. P. Szabó: ‘Undecidability of the DA-Unification Problem’, Proc. of GWAI, 1979 (full paper submitted)

    Google Scholar 

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

    Google Scholar 

  102. P. Szabo, E. Unvericht: ‘The Unification Problem for Distributive Terms’, Universität Karlsruhe, 1978

    MATH  Google Scholar 

  103. P. Szabó: ‘Paramodulation and Unification’, Universität Karlsruhe, 1982 (in preparation)

    Google Scholar 

  104. J. Slagle: ‘ATP for Theories with Simplifiers, Commutativity and Associativity’, JACM 21, 1974

    Google Scholar 

  105. M. Stickel: ‘A Unification Algorithm for Assoc. Commutative Functions’, JACM, vol 28, no. 3, 1981

    Google Scholar 

  106. E.H. Shortliffe: ‘MYCIN: Computer Based Medical Consultations’, North Holland Publ. Comp. 1976

    Google Scholar 

  107. D. Skordew, B. Sendow: ‘Z. Math. Logic Grundlagen’, Math. 7 (1961), 289, MR 31, 57 (Russian) (English translation at University of Essex, Comp. Sci. Dept.)

    Google Scholar 

  108. J.R. Slagle: ‘ATP with built-in theories including equality, partial ordering and sets’, JACM 19, 120–135, 1972

    Article  MathSciNet  MATH  Google Scholar 

  109. B.C. Smith, C. Hewitt: ‘A Plasma Primer’, MIT, AI-Lab., 1975

    Google Scholar 

  110. G.F. Stewart: ‘An Algebraic Model for String Patterns’, University of Toronto, CSRG-39, 1974

    Google Scholar 

  111. E. Sussenguth: ‘A graph-theoretical algorithm for matching chemical structures’, J. Chem. Doc. 5, 1, 1965

    Article  Google Scholar 

  112. SIGSAM Bulletin: ‘ACM special interest group on Symbolic and Algebraic Manipulation’, vol 11, no. 3, 1977 (issue no. 43) contains an almost complete bibliography

    Google Scholar 

  113. H. Tennant: ‘Natural Language Processing’, Petrocelli Books, 1981

    Google Scholar 

  114. A. Tarski: ’Equational Logic and Equational Theories of Algebra’, Schmidt et al (eds), Contributions to Mathematical Logic, North Holland, 1968

    Google Scholar 

  115. W. Taylor: ‘Equational Logic’, Colloquia Mathematica Societatis Janos Bolya, 1975

    Google Scholar 

  116. J.R. Ullman: ‘An Algorithm for Subgraph Isomorphism’, JACM, vol 23, no.1, 1976

    Google Scholar 

  117. S.H. Unger: ‘GIT -A Heuristic Program for Testing Pairs of directed Line Graphs for Isomorphism’, CACM, vol 7, no. 1, 1964

    Google Scholar 

  118. J. van Vaalen: ‘An Extension of Unification to Substitutions with an Application to ATP’, Proc. of Fourth IJCAI, Tbilisi, USSR, 1975

    Google Scholar 

  119. E. Vogel: ‘Unifikation von Morphismen’, Diplomarbeit, Univer-sität Karlsruhe, 1978

    Google Scholar 

  120. D.H.D. Warren: ‘Implementing PROLOG’, vol 1 and vol 2, D.A.I. Research Rep., no. 39, University of Edinburgh, 1977

    Google Scholar 

  121. P. Weiner: ‘Linear Pattern Matching Algorithms’, IEEE Symp. on Sw. and Automata Theory, 14, 1973

    Google Scholar 

  122. van Wijngaarden (et al): ‘Revised Rep. on the Algorithmic Language ALGOL68’, Springer-Verlag, Berlin, Heidelberg, N.Y., 1976

    Google Scholar 

  123. Winston: ‘The Psychology of Computer Vision’, McGraw Hill, 1975

    Google Scholar 

  124. G. Winterstein: ‘Unification in Second Order Logic’, Bericht 3, Universität Kaiserslautern, 1976

    Google Scholar 

  125. K. Wong, K. Chandra: ‘Bounds for the String Editing Problem’, JACM, vol 23, no. 1, 1976

    Google Scholar 

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

    Google Scholar 

  127. L. Wos, G.A. Robinson, D. Carson, L. Shalla: ‘The Concept of Demodulation in Theorem Proving’, JACM, vol 14, no. 4, 1967

    Google Scholar 

  128. N. Whitehead: ‘Treatise on Universal Algebra’, 1898

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik I, Universität Karlsruhe, Postfach 6380, D-7500, Karlsruhe 1, 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

Editors and Affiliations

  1. Forschungsstelle für Informationswissenschaft und Künstliche Intelligenz, Universität Hamburg, Mittelweg 179, 2000, Hamburg 13, Germany

    Wolfgang Wahlster (Vorsitzender des Programmkomitees) (Vorsitzender des Programmkomitees)

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. In: Wahlster, W. (eds) GWAI-82. Informatik-Fachberichte, vol 58. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68826-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-68826-3_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11960-9

  • Online ISBN: 978-3-642-68826-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation