Combining matching algorithms: The regular case

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

Volumn 355 LNCS, Issue , 1989, Pages 343-358

  Nipkow, Tobias ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROBLEM SOLVING;

ARBITRARY EQUATIONAL THEORY; EQUATIONAL THEORY; MATCHING ALGORITHM; MATCHING PROBLEMS; SIMPLE ALGORITHM; WORD PROBLEM;

CRYPTOGRAPHY;

EID: 85032488739     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-51081-8_118     Document Type: Conference Paper

References (20)

1. H.-J. Bürckert: Some Relationships Between Unification, Restricted Unification and Matching, in: Proc. CADE-8, LNCS 230 (1986), 514-524.
2. H.-J. Bürckert: Matching - A Special Case of Unification?, Tech. Rep., Universität Kaiserslautern (1987).
3. N. Dershowitz, Z. Manna: Proving Termination with Multiset Orderings, CACM 22(1979), 465-476.
4. K. Futatsugi, J.A. Goguen, J.-P. Jouannaud, J. Meseguer: Principles of OBJ2, in: Proc. 12th POPL (1985), 52-66.
5. S.J. Garland, J.V. Guttag: An Overview of LP, The Larch Prover, in: Proc. RTA-89, LNCS (1989).
6. A. Herold: Combination of Unification Algorithms, in: Proc. CADE-8, LNCS 230 (1986), 450-469.
7. A. Herold: Combination of Unification Algorithms in Equational Theories, Ph.D. Thesis, Fachbereich Informatik, Universität Kaiserslautern (1987).
8. G. Huet: Confluent Reductions: Abstract properties and Applications to Term Rewriting Systems, JACM 27, 4 (1980), 797-821.
9. G. Huet, D.C. Oppen: Equations and Rewrite Rules - A Survey, in: Formal Languages: Perspectives and Open Problems, R. Book (ed.), Academic Press (1982).
10. J.-P. Jouannaud, H. Kirchner: Completion of a Set of Rules Modulo a Set of Equations, SIAM Journal of Computing 15 (1986), 1155-1194.
11. C. Kirchner: Méthodes et outils de conception systématique d’algorithmes d’unification dans les théories équationnelles, Thèse d’état de l’Université de Nancy I (1985).
12. C. Kirchner, personal communication, June 1988.
13. P. Lescanne: REVE: A Rewrite Rule Laboratory, in: Proc. CADE-8, LNCS 230 (1986), 695-696.
14. G.E. Peterson, M.E. Stickel: Complete Sets of Reductions for Some Equational Theories, JACM, 28, 2 (1981), 233-264.
15. M. Schmidt-Schauß: Unification in a Combination of Arbitrary Disjoint Equational Theories, Tech. Rep., Universität Kaiserslautern (1987).
16. J.H. Siekmann: Universal Unification, in: Proc. CADE-7, LNCS 170 (1984).
17. E. Tidén: Unification in Combinations of Collapse-Free Theories with Disjoint Sets of Function Symbols, in: Proc. CADE-8, LNCS 230 (1986), 431-449.
18. E. Tidén: First-Order Unification in Combinations of Equational Theories, PhD Thesis, Department of Numerical Analysis and Computing Science, The Royal Institute of Technology, Stockholm (1986).
19. K. Yelick: Unification in Combinations of Collapse-Free Regular Theories, JSC 3 (1987), 153-181.
20. P. Szabó: Unifikationstheorie erster Ordnung, Ph.D. Thesis, Universität Karlsruhe (1982).