Skip to main content
SpringerLink
Log in

Weakly Regular Relations and Applications

  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 2001)

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

Included in the following conference series:

Abstract

A new class of tree-tuple languages is introduced: the weakly regular relations. It is an extension of the regular case (regular relations) and a restriction of tree-tuple synchronized languages, that has all usual nice properties, except closure under complement. Two applications are presented: to unification modulo a rewrite system, and to one-step rewriting.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.C. Caron, F. Seynhaeve, S. Tison, and M. Tommasi. Deciding the Satisfiability of Quantifier Free Formulae on One-Step Rewriting. In Proceedings of 10th Conference RTA, Trento (Italy), volume 1631 of LNCS. Springer-Verlag, 1999.

    Google Scholar 

  2. H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications (TATA). http://l3ux02.univ-lille3.fr/tata.

  3. L. Fribourg. SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting. In proceedings IEEE Symposium on Logic Programming, pages 172–185, Boston, 1985.

    Google Scholar 

  4. V. Gouranton, P. Réty, and H. Seidl. Synchronized Tree Languages Revisited and New Applications. In Proceedings of FoSSaCs, volume to appear of LNCS. Springer-Verlag, 2001.

    Google Scholar 

  5. M. Hermann and R. Galbavý. Unification of Infinite Sets of Terms Schematized by Primal Grammars. Theoretical Computer Science, 176, 1997.

    Google Scholar 

  6. F. Jacquemard. Automates d’Arbres et Réécriture de Termes. Thèse de Doctorat d’Université, Université de Paris-sud, 1996. In French.

    Google Scholar 

  7. S. Limet and P. Réty. E-Unification by Means of Tree Tuple Synchronized Grammars. In Proceedings of 6th Colloquium on Trees in Algebra and Programming, volume 1214 of LNCS, pages 429–440. Springer-Verlag, 1997. Full version in DMTCS (http://dmtcs.loria.fr/), volume 1, pages 69–98, 1997.

    Google Scholar 

  8. S. Limet and P. Réty. A New Result about the Decidability of the Existential One-step Rewriting Theory. In Proceedings of 10th Conference on Rewriting Techniques and Applications, Trento (Italy), volume 1631 of LNCS. Springer-Verlag, 1999.

    Google Scholar 

  9. S. Limet, P. Réty, and H. Seidl. Weakly Regular Relations and Applications. Research Report RR-LIFO-00-17, LIFO, 2000. http://www.univ-orleans.fr/SCIENCES/LIFO/Members/rety/publications.html.

  10. S. Limet and F. Saubion. On partial validation of logic programs. In M. Johnson, editor, proc of the 6th Conf. on Algebraic Methodology and Software Technology, Sydney (Australia), volume 1349 of LNCS, pages 365–379. Springer Verlag, 1997.

    Chapter  Google Scholar 

  11. S. Limet and F. Saubion. A general framework for R-unification. In C. Palamidessi, H. Glaser, and K. Meinke, editors, proc of PLILP-ALP’98, volume 1490 of LNCS, pages 266–281. Springer Verlag, 1998.

    Google Scholar 

  12. J. Marcinkowski. Undecidability of the First-order Theory of One-step Right Ground Rewriting. In Proceedings 8th Conference RTA, Sitges (Spain), volume 1232 of LNCS, pages 241–253. Springer-Verlag, 1997.

    Google Scholar 

  13. J. Niehren, M. Pinkal, and P. Ruhrberg. On Equality up-to Constraints over Finite Trees, Context Unification and One-step Rewriting. In W. Mc Cune, editor, Proc. of CADE’97, Townsville (Australia), volume 1249 of LNCS, pages 34–48, 1997.

    Google Scholar 

  14. P. Réty. Regular Sets of Descendants for Constructor-based Rewrite Systems. In Proceedings of the 6th international conference on Logic for Programming and Automated Reasoning (LPAR), Tbilisi (Republic of Georgia), Lecture Notes in Artificial Intelligence. Springer-Verlag, 1999.

    Google Scholar 

  15. F. Seynhaeve, M. Tommasi, and R. Treinen. Grid Structures and Undecidable Constraint Theories. In Proceedings of 6th Colloquium on Trees in Algebra and Programming, volume 1214 of LNCS, pages 357–368. Springer-Verlag, 1997.

    Google Scholar 

  16. R. Treinen. The First-order Theory of One-step Rewriting is Undecidable. Theoretical Computer Science, 208:179–190, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  17. S. Vorobyov. The First-order Theory of One-step Rewriting in Linear Noetherian Systems is Undecidable. In Proceedings 8th Conference RTA, Sitges (Spain), volume 1232 of LNCS, pages 241–253. Springer-Verlag, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFO, Université d’Orléans, France

    Sébastien Limet & Pierre Réty

  2. Dept. of Computer Science, University of Trier, Germany

    Helmut Seidl

Authors
  1. Sébastien Limet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Réty
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Helmut Seidl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Information Sciences and Electronics, University of Tsukuba, Tsukuba, 305-8573, Japan

    Aart Middeldorp

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Limet, S., Réty, P., Seidl, H. (2001). Weakly Regular Relations and Applications. In: Middeldorp, A. (eds) Rewriting Techniques and Applications. RTA 2001. Lecture Notes in Computer Science, vol 2051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45127-7_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-45127-7_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42117-7

  • Online ISBN: 978-3-540-45127-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation