Universal unification and a classification of equational theories

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 138 LNCS, Issue , 1982, Pages 369-389

  Siekmann, J ^a   Szabo P ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85025511514     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0000071     Document Type: Conference Paper

References (54)

1. L.D. Baxter, An Efficient Unification Algorithm, Univ. of Waterloo, Techn. Report CS-73-23, 1973.
2. L.D. Baxter, Hie Undecidability of the Third Order Dyadic Unification Problem, Information and Control, vol 33, no 2, 1978.
3. M. Davis, Hilbert’s tenth Problem is unsolvable, Amer. Math. Monthly, vol 80, 1973.
4. th Workshop on Autom. Deduction, Texas, 1979.
5. J.R. Guard, F.C. Oglesby, J.H. Benneth, L.G. Settle, Serai-Automated Mathematics, JACM 1969, vol 18, no 1.
6. D. Goldfarb, The Undecidability of the Second Order Unification Problem, J. of Theor. Comp. Sci. 13, 1981.
7. W.E. Gould, A Matching Procedure for co-order Logic (thesis), Air Force Cambridge Research Labs, 1966.
8. G. Grãtzer, Universal Algebra, Springer Verlag, 1979.
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.
10. J. Hmelevskij, The Solution of certain Systems of Word Equations, Dok. Akad. Nauk SSSR (1964), (1966), (1967), (Soviet Math. Dokl.).
11. G. Huet, The Undecidability of Unification in Third Order Logic, Information and Control 22, 1973.
12. G. Huet, Resolution d’equations dans des langages d’ordere l, 2,...,ω, Thèse d’Etat, Univ. de Paris, 7, 1976.
13. G. Huet, A Unification Algorithms for Typed Lambda Calculus, J. Theoretic. Comp. Sci., 1, 1975.
14. G. Huet, D.C. Oppen, Equations and Rewrite Rules, In “Formal Languages: Perspectives and Open Problems”, Ed. R. Book, Academic Press, 1980.
15. G. Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems, JACM, vol 27, no 4, 1980.
16. J.M. Hullot, Canonical Forms and Unification, Proc. of 5 Workshop on Automated Deduction, Springer Lecture Notes, 1980.
17. J.M. Hullot, A Catalogue of Canonical Term Rewriting Systems, Research Rep. CSL-113, SRI-International, 1980.
18. A. Herold, Universal Unification and extended regular ACFM Theories, Univ. Karlsruhe, 1982.
19. D. Knuth, P. Bendix, Simple Word Problems in Universal Algebras, in: Comp. Problems in Abstract Algebra. J. Leech (ed), Pergamon Press, 1970.
20. R. Kowalski, A Proof Procedure based on Connection Graphs, JACM, vol 22, no 4, 1975.
21. D.S. Lankford, A Unification Algorithm for Abelian Group Theory, Rep. MTP-1, Louisiana Techn. Univ., 1979.
22. D.S. Lankford, M. Ballantyne, The Refutation Completeness of Blocked Permutative Narrowing and Resolution, 4th Workshop on Autora. Deduction, Texas, 1979.
23. M. Livesey, J. Siekmann, Termination and Decidability Results for String-unification, Univ. of Essex, Memo CSM-12, 1975.
24. M. Livesey, J. Siekmann, Unification of Sets and Multisets, Univ. Karlsruhe, Techn. Report, 1976.
25. D. Loveland, Automated Theorem Proving, North Holland, 1980.
26. G.S. Makanin, Ttie Problem of Solvability of Equations in a Free Semigroup, Soviet Akad. Nauk SSSR, Tom 233, no 2, 1977.
27. A. Martelli, U. Montaneri, An Efficient Unification Algorithm, University of Pisa, Techn. Report, 1979.
28. Y. Matiyasevich, Diophantine Representation of Rec. Enumerable Predicates, Proc. of the Scand. Logic Symp., North Holland, 1978.
29. N. Nilsson, Principles of Artificial Intelligence, Tioga Publ. Comp., California, 1980.
30. M. Paterson, M. Wegman, Linear Unification, J. of Comp, and Syst. Science, 1978, 16.
31. D. Prawitz, An Improved Proof Procedure, Theoria 26, 1960.
32. G. Peterson, M. Stickel, Complete Sets of Reductions for Equational Theories with Complete Unification Algorithms, JACM, vol 28, no 2, 1981.
33. G. Plotkin, Building in Equational Theories, Machine Intelligence, vol 7, 1972.
34. P. Raulefs, J. Siekmann, Unification of Idempotent Functions, universitat Karlsruhe, 1978.
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.
36. J.A. Robinson, A Machine Oriented Logic based on the Resolution Principle, JACM 12, 1965.
37. J.A. Robinson, Computational Logic: The Unification Computation, Machine Intelligence, vol 6, 1971.
38. J. Siekmann, Stringunification, University of Essex, Memo CSM-7.
39. J. Slagle, ATP for Theories with Simplifiers, Commutativity and Associativity JACM 21, 1974.
40. M. Stickel, A complete Unification Algorithm for assoc, commutative functions Proc. of 4th ijcai, Tbilisi, USSR, 1975.
41. J. Siekmann, Unification of Commutative Terms (submitted), Universitãt Karlsruhe, 1982.
42. P. Szabò, J. Siekmann, A Minimal Unification Algorithm for Idempotent Functions, Universitãt Karlsruhe, 1982 (forthcoming).
43. P. Szabõ, J. Siekmann, Unification in Idempotent Semigroups (forthcoming), Universitãt Karlsruhe, 1982.
44. P. Szabò, J. Siekmann, Universal Unification and a Classification of Equational Theories, Universitãt Karlsruhe, 1982 (full paper submitted).
45. P. Szabò, J. Siekmann, Universal Unification and Regular ACFM Theories, Proc. of IJCAI-81 (full paper submitted).
46. P. Szabõ, The Undecidability of the D-Unification Problem, Universitãt Karlsruhe, 1978.
47. P. Szabò, Theory of First Order Unification (in German, thesis), Universitãt Karlsruhe, 1982.
48. J. van Vaalen, An Extension of Unification to Substitutions with an Application to Automatic Theorem Proving, IJCAI-4, Proc. of 1975.
49. Vogel Unifikationsalgorithmen fur Morphismen, Universitãt Karlsruhe (in German, Diploma thesis), 1978.
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.
51. L. Wos, G.A. Robinson, D. Carson, L. Shalla The Concept of Demodulation in Theorem Proving, JACM, vol 14, no 4.
52. P. Szabò, J. Siekmann, A Noetherian and Confluent Rewrite System for Idempotent Semigroups, Semigroup Forum 1982.
53. D. Lankford, A new complete FPA-Unification algorithm, Jan. 1980, MTP-8.
54. F Fages, private communication (to appear as INRIA report, France).