Jeopardy

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

Volumn 1631, Issue , 1999, Pages 16-29

  Dershowitz, Nachum ^a   Mitra, Subrata ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b Enterprise Component Technology   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

REWRITE SYSTEMS;

ARTIFICIAL INTELLIGENCE;

EID: 84957657203     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48685-2_2     Document Type: Conference Paper

References (17)

1. Aguzzi, G., Modigliani, U.: A criterion to decide the semantic matching problem. Proc. Intl. Conf. on Logic and Algebra, Italy (1995).
2. Christian, J.: Some termination criteria for narrowing and E-narrowing. Proc. 11th Intl. Conf. on Automated Deduction, Saratoga Springs, NY. Lecture Notes in Artificial Intelligence 607:582-588, Springer-Verlag, Berlin (1992).
3. Comon, H.: On unification of terms with integer exponents. Tech. Rep. 770, Université de Paris-Sud, Laboratoire de Réchérche en Informatique (1992).
4. Comon, H., Haberstrau, M., Jouannaud, J.P.: Decidable problems in shallow equational theories. Tech. Rep. 718, Université de Paris-Sud, Laboratoire de Réchérche en Informatique (1991).
5. Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In J. van Leeuwen, ed., Handbook of Theoretical Computer Science B: 243-320, North-Holland, Amsterdam (1990).
6. Dershowitz, N., Mitra, S.: Higher-order and semantic unification. Proc. 13th Conf. on Foundations of Software Technology and Theoretical Computer Science, Bombay, India. Lecture Notes in Artificial Intelligence 761:139-150, Springer-Verlag, Berlin (1993).
7. Dershowitz, N., Mitra, S., Sivakumar, G.: Decidable matching for convergent systems (Preliminary version). Proc. 11th Conference on Automated Deduction, Saratoga Springs, NY. Lecture Notes in Artificial Intelligence 607:589-602, Springer-Verlag, Berlin (1992).
8. Dershowitz, N., Plaisted, D. A.: Equational programming. In: J. E. Hayes, D. Michie, J. Richards, eds., Machine Intelligence 11: The logic and acquisition of knowledge, 21-56. Oxford Press, Oxford (1988).
9. Dershowitz, N., Reingold, E. M.: Calendrical Calculations. Cambridge University Press, Cambridge (1997).
10. Fages, F., Huet, G.: Unification and matching in equational theories. Proc. 8th Colloq. on Trees in Algebra and Programming, L'Aquila, Italy. Lecture Notes in Computer Science 159:205-220, Springer-Verlag, Berlin (1983).
11. Heilbrunner, S., Hölldobler, S.: The undecidability of the unification and matching problem for canonical theories. Acta Informatica 24(2):157-171 (1987).
12. Hullot, J.-M.: Canonical forms and unification. Proc. 5th Intl. Conf. on Automated Deduction, Les Arcs, France, Lecture Notes in Computer Science 87:318-334, Springer-Verlag, Berlin (1980).
13. Jacquemard, F.: Decidable approximations of term rewriting systems. Proc. 7th Intl. Conf. on Rewriting Techniques and Applications, New Brunswick, NJ. Lecture Notes in Computer Science 1103:362-376, Springer-Verlag, Berlin (1966).
14. Mitra, S.: Semantic unification for convergent systems. Ph.D. thesis, Dept. of Computer Science, University of Illinois, Urbana, IL, Tech. Rep. UIUCDCS-R-94-1855 (1994).
15. Narendran, P., Pfenning, F., Statman, R.: On the unification problem for Cartesian closed categories. J. Symbolic Logic 62(2):636-647 (1997).
16. Nieuwenhuis, R.: Decidability and complexity analysis by basic paramodulation. Information and Computation 147:1-21 (1998).
17. Plaisted, D. A.: Semantic confluence tests and completion methods. Information and Computation 65:182-215 (1985).