Decidability of unification in the theory of one-sided distributivity and a multiplicative unit

Journal of Symbolic Computation

Volumn 22, Issue 3, 1996, Pages 315-344

  Schmidt Schauß, Manfred ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030103149     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1996.0054     Document Type: Article

References (24)

1. Bergstra, J.A., Klop, J.W. (1985). Algebra of communicating processes with abstraction. J. Theoretical Computer Science, 37:77-121.
2. Baader, F., Schulz, K.U. (1992). Unification in the union of disjoint equational theories: Combining decision procedures. In Proceedings of the 11th International Conference on Automated Deduction, volume 607 of Lecture Notes in Computer Science, pp. 50-65. Springer-Verlag.
3. Baader, F., Siekmann, J. (1994). Unification theory. In D.M. Gabbay, C.J. Hogger and J.A. Robinson, (eds), Handbook of Logic in Artificial Intelligence and Logic Programming, pp. 41-125. Oxford University Press.
4. Baeten, J.C.M., Weijland, W.P. (1990). Process Algebra. Cambridge University Press.
5. Contejean, E. (1992). Unification under distributivity. Unification workshop 1992, Dagstuhl, Germany.
6. Contejean, E. (1993). Solving *-problems modulo distributivity by a reduction to AC1-unification. J. Symbolic Computation, 16:493-521.
7. Davis, M. (1973). Hilberts tenth problem is unsolvable. Amer. Math. Monthly, 80:233-269.
8. Farmer, W.A. (1988). A unification algorithm for second order monadic terms. Annals of Pure and Applied Logic, 39:131-174.
9. Jaffar, J. (1990). Minimal and complete word unification. J. of the ACM, 37(1):47-85.
10. Kirchner, C. (ed.) (1989). Unification. Academic Press.
11. th Annual IEEE Symposium foundations of computer science, pp. 824-829.
12. Makanin, G.S. (1977). The problem of solvability of equations in a free semigroup. Math. USSR Sbornik, 32(2):129-198.
13. Matijasevic, Y. (1973). Hilbert's tenth problem. In P. Suppes, L. Henkin, Y. Joyal and G. C. Moisil, (eds), Logic, Methodology and Philosophy of Science, pp. 129-198. Amsterdam: North-Holland.
14. Narendran, P., Pfenning, F., Statman, R. (1993). On the unification problem in Cartesian closed categories. In Proceedings of the 8th Annual IEEE Symposium on Logic in Computer Science, pp. 57-63.
15. Rittri, M. (1990). Retrieving library identifiers via equational matching of types. In Proceedings of the 10th International Conference on Automated Deduction, LNCS, pp. 603-617.
16. Schulz, K. U. (1990). Makanin's algorithm-two improvements and a generalization. In Proc. of IWWERT 1990, LNCS, pp. 85-150. Springer-Verlag.
17. Siekmann, J.H. (1989). Unification theory: A survey. J. Symbolic Computation, 7(3,4):207-274.
18. Schmidt-Schauß, M. (1989). Unification in a combination of arbitrary disjoint equational theories. J. Symbolic Computation, 8(1,2):51-99.
19. Schmidt-Schauß, M. (1992). Some results for distributive unification. Internal Report 7/92, Fachbereich Informatik, J.W. Goethe-Universität Frankfurt, Frankfurt, Germany.
20. Schmidt-Schauß, M. (1993). Unification under one-sided distributivity with a multiplicative unit. In Proc. Logic Programming and Automated Reasoning 1993, LNCS, pp. 289-300. Springer-Verlag.
21. Schmidt-Schauß, M. (1994). An algorithm for distributive unification. Internal Report 13/94, Fachbereich Informatik, J.W. Goethe-Universität Frankfurt, Frankfurt, Germany.
22. Schmidt-Schauß, M. (1996). An algorithm for distributive unification. In Proceedings of the 7th International Conference on Rewriting Techniques and Applications, pp. 287-301.
23. Szabó, P. (1982). Unifikationstheorie Erster Ordnung. Ph.D. thesis, Universität Karlsruhe. In German.
24. Tidén, E., Arnborg, S. (1987). Unification problems with one-sided distributivity. J. Symbolic Computation, 3:183-202.