Skip to main content
SpringerLink
Log in

Linear Second-Order Unification and Context Unification with Tree-Regular Constraints

  • Conference paper
Book cover Rewriting Techniques and Applications (RTA 2000)

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

Included in the following conference series:

Abstract

Linear Second-Order Unification and Context Unification are closely related problems. However, their equivalence was never formally proved. Context unification is a restriction of linear second-order unification. Here we prove that linear second-order unification can be reduced to context unification with tree-regular constraints.

Decidability of context unification is still an open question. We comment on the possibility that linear second-order unification is decidable, if context unification is, and how to get rid of the tree-regular constraints. This is done by reducing rank-bound tree-regular constraints to word-regular constraints.

The first author is partially supported by the project MODELOGOS founded by the CICYT.

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. Comon, H.: Completion of rewrite systems with membership constraints. J. of Symbolic Computation 25(4), 397–453 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), Available on: http://www.grappa.univ-lille3.fr/tata

  3. Levy, J.: Linear second-order unification. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol. 1103, pp. 332–346. Springer, Heidelberg (1996)

    Google Scholar 

  4. Levy, J.: Decidable and undecidable second-order unification problems. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol. 1379, pp. 47–60. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  5. Levy, J., Agustí, J.: Bi-rewrite systems. J. of Symbolic Computation 22, 279–314 (1996)

    Article  MATH  Google Scholar 

  6. Levy, J., Veanes, M.: On the undecidability of second-order unification. Information and Computation (2000) (to appear)

    Google Scholar 

  7. Levy, J., Villaret, M.: On the decidability of context unification. Technical report, IIIA, CSIC (2000)

    Google Scholar 

  8. Makanin, G.S.: The problem of solvability of equations in a free semigroup. Math. USSR Sbornik 32(2), 129–198 (1977)

    Article  MATH  Google Scholar 

  9. Niehren, J., Pinkal, M., Ruhrberg, P.: On equality up-to constraints over finite trees, context unification, and one-step rewriting. In: McCune, W. (ed.) CADE 1997. LNCS, vol. 1249, pp. 34–48. Springer, Heidelberg (1997)

    Google Scholar 

  10. Schmidt-Schauß, M.: An algorithm for distributive unification. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol. 1103, pp. 287–301. Springer, Heidelberg (1996)

    Google Scholar 

  11. Schmidt-Schauß, M.: A decision algorithm for distributive unification. Theoretical Computer Science 208, 111–148 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  12. Schmidt-Schauß, M.: Decidability of bounded second-order unification. Technical Report Frank-report-11, FB Informatik, J.W. Goethe Universität Frankfurt (1999)

    Google Scholar 

  13. Schmidt-Schauß, M.: A decision algorithm for stratified context unification. Technical Report Frank-report-12, FB Informatik, J.W. Goethe Universität Frankfurt (1999)

    Google Scholar 

  14. Schmidt-Schauß, M., Schulz, K.U.: On the exponent of periodicity of minimal solutions of context equations. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol. 1379, pp. 61–75. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  15. Schmidt-Schauß, M., Schulz, K.U.: Solvability of context equations with two context variables is decidable. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol. 1632, pp. 67–81. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  16. Schulz, K.U.: Makanin’s algorithm, two improvements and a generalization. Technical Report CIS-Bericht-91-39, Centrum für Informations und Sprachver-arbeitung, Universität München (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IIIA, CSIC, Campus de la UAB, Bellaterra, Barcelona, Spain

    Jordi Levy

  2. IMA, UdG, U. de Girona, Campus Montilivi, Girona, Spain

    Mateu Villaret

Authors
  1. Jordi Levy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mateu Villaret
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Stony Brook University, Stony Brook, P.O. Box, New York

    Leo Bachmair

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Levy, J., Villaret, M. (2000). Linear Second-Order Unification and Context Unification with Tree-Regular Constraints. In: Bachmair, L. (eds) Rewriting Techniques and Applications. RTA 2000. Lecture Notes in Computer Science, vol 1833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10721975_11

Download citation

  • DOI: https://doi.org/10.1007/10721975_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67778-9

  • Online ISBN: 978-3-540-44980-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation