A good class of tree automata. Application to inductive theorem proving

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

Volumn 1443 LNCS, Issue , 1998, Pages 409-420

  Lugiez, D ^a,b  

^a UNIVERSITÉ DE PROVENCE   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84878602508     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (18)

1. A. Bouhoula, J.-P. Jouannaud. Automata-driven automated induction. In Proc. 12th IEEE Symp. on LICS, p. 14-25. IEEE Comp. Soc. Press, 1997.
2. R. S. Boyer and J. S. Moore. A Computational Logic Handbook. Academic Press inc., Boston, 1988.
3. A. Bouhoula, M. Rusinowitch. Implicit induction in conditional theories. J. of Automated Reasoning, 14(2):189-235, 1995.
4. B. Bogaert, S. Tison. Equality and disequality constraints on direct subterms in tree automata. In Proc. of the 9th STACS, vol. 577 of LNCS, p. 161-172, 1992.
5. A.C. Caron, H. Comon, J.L. Coquidé, M. Dauchet, F. Jacquemard. Pumping, cleaning and symbolic constraints solving. In Proc. 21st 1CALP, Jerusalem (Israel), p. 436-449, 1994.
6. B. Courcelle. On Recognizable Sets and Tree Automata, in Resolution of Equations in Algebraic Structures. Academic Press, M. Nivat and Ait-Kaci editors, 1989.
7. M. Dauchet, Caron A.-C, Coquidé J.-L. Reduction properties and automata with constraints. J. of Symb. Comp., 20:215-233, 1995.
8. N. Dershowitz, J.-P. Jouannaud. Handbook of Theoretical Computer Science, vol. B, chapter 6: Rewrite Systems, p. 244-320. Elsevier Science Publishers B. V. (North-Holland), 1990.
9. S. Ginsburg, E.H. Spanier. Semigroups, Presburger Formulas, and Languages. Pacific J. Math., 16:285-296, 1966.
10. D. Kapur, P. Narendran, D. J. Rosenkrantz, H. Zhang. Sufficient completeness, ground-reducibility and their complexity. Acta Informatica, 28:311-350, 1991.
11. D. Kapur, M. Subramaniam. New uses of linear arithmetic in automated theorem proving by induction. J. of Automated Reasoning, 16(1-2):39-78, March 1996.
12. D. Kapur, H. Zhang. RRL: A rewrite rule laboratory. In Proc. 9th CADE, Argonne (Ill., USA), vol. 310 of LNCS, p 768-769. Springer-Verlag, 1988.
13. D. Lugiez, J.-L. Moysset. Tree automata help one to solve equational formulae in AC-theories. J. of Symb. Comp., 18(4):297-318, 1994.
14. B. Monate. Automates de forme normale et reductibilite inductive. Tech. Rep., LRI, Univ. Paris Sud, Bat 490, 91405 ORSAY, FRANCE, 1997.
15. J. Niehren, A. Podelski. Feature automata and recognizable sets of feature trees. In Proc. TAPSOFT'93, vol. 668 of LNCS, p. 356-375, 1993.
16. R.J. Parikh. On context-free languages. J. of the ACM, 13:570-581, 1966.
17. D. Plaisted. Semantic confluence and completion method. Information and Control, 65:182-215, 1985.
18. H. Seidl. Deciding equivalence of finite tree automata. SIAM J. Comput., 19, 1990.