Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1443))

Included in the following conference series:

Abstract

We have presented a new class of tree automata which can deal with several interpreted domains and which extends previous works on constrained tree automata and automata dealing with AC axioms. The proof used for the decision of emptiness in the multiset case is new and may have other applications. This approach is complementary of the approach in [BJ97] which deals with specifications involving equations between constructors but doesn't handle the domains that we consider. Future work will be to embed the previous approach of [LM94] in our class and to look for efficient implementation of tree automata algorithms with AC symbols similar to [Mon97].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Google Scholar 

  2. R. S. Boyer and J. S. Moore. A Computational Logic Handbook. Academic Press inc., Boston, 1988.

    MATH  Google Scholar 

  3. A. Bouhoula, M. Rusinowitch. Implicit induction in conditional theories. J. of Automated Reasoning, 14(2):189–235, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  4. B. Bogaert, S. Tison. Equality and disequality constraints on direct sub-terms in tree automata. In Proc. of the 9th STACS, vol. 577 of LNCS, p. 161–172, 1992.

    Google Scholar 

  5. A.C. Caron, H. Comon, J.L. Coquidé, M. Dauchet, F. Jacquemard. Pumping, cleaning and symbolic constraints solving. In Proc. 21st ICALP, Jerusalem (Israel), p. 436–449, 1994.

    Google Scholar 

  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.

    Google Scholar 

  7. M. Dauchet, Caron A.-C, Coquidé J.-L. Reduction properties and automata with constraints. J. of Symb. Comp., 20:215–233, 1995.

    Article  MATH  Google Scholar 

  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.

    Google Scholar 

  9. S. Ginsburg, E.H. Spanier. Semigroups, Presburger Formulas, and Languages. Pacific J. Math., 16:285–296, 1966.

    MATH  MathSciNet  Google Scholar 

  10. D. Kapur, P. Narendran, D. J. Rosenkrantz, H. Zhang. Sufficient completeness, ground-reducibility and their complexity. Acta Informatica, 28:311–350, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  14. B. Monate. Automates de forme normale et reductibilite inductive. Tech. Rep., LRI, Univ. Paris Sud, Bat 490, 91405 ORSAY, FRANCE, 1997.

    Google Scholar 

  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.

    MathSciNet  Google Scholar 

  16. R.J. Parikh. On context-free languages. J. of the ACM, 13:570–581, 1966.

    Article  MATH  MathSciNet  Google Scholar 

  17. D. Plaisted. Semantic confluence and completion method. Information and Control, 65:182–215, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  18. H. Seidl. Deciding equivalence of finite tree automata. SIAM J. Comput., 19, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lab. d'Informatique de Marseille, Université de Provence, CMI 39 av. Joliot Curie, 13453, Marseille Cedex, France

    D. Lugiez

  2. Inria-Lorraine, 615 rue rue du Jardin Botanique, BP 101, 54601, Villèrs les Nancy, France

    D. Lugiez

Authors
  1. D. Lugiez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kim G. Larsen Sven Skyum Glynn Winskel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lugiez, D. (1998). A good class of tree automata. Application to inductive theorem proving. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055071

Download citation

  • DOI: https://doi.org/10.1007/BFb0055071

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64781-2

  • Online ISBN: 978-3-540-68681-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation