Skip to main content
SpringerLink
Log in

Parallelism and Tree Regular Constraints

  • Conference paper
  • First Online:
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2514))

Abstract

Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Parallelism constraints belong to the constraint language for lambda structures (CLLS) which serves for modeling natural language semantics. In this paper, we investigate the extension of parallelism constraints by tree regular constraints. This canonical extension is subsumed by the monadic second-order logic over parallelism constraints. We analyze the precise expressiveness of this extension on basis of a new relationship between tree automata and logic. Our result is relevant for classifying different extensions of parallelism constraints, as in CLLS. Finally, we prove that parallelism constraints and context unification remain equivalent when extended with tree regular constraints.

This work has been partially supported by the SFB 378 of the DFG and the CICYT projects DENOC (BFM2000-1054-C02) and CADVIAL (TIC2001-2392-C03-01).

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. Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, and Sven Thiel. An efficient algorithm for the configuration problem of dominance graphs. In 12th ACM-SIAM Symposium on Discrete Algorithms, pages 815–824, 2001.

    Google Scholar 

  2. R. Backofen, J. Rogers, and K. Vijay-Shanker. A first-order axiomatization of the theory of finite trees. Journal of Logic, Language, and Information, 4:5–39, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  3. Manuel Bodirsky, Katrin Erk, Alexander Koller, and Joachim Niehren. Beta reduction constraints. In RTA’01, volume 2051 of LNCS, pages 31–46, 2001.

    Google Scholar 

  4. Manuel Bodirsky, Katrin Erk, Alexander Koller, and Joachim Niehren. Underspecified beta reduction. In ACL’ 01, pages 74–81, 2001.

    Google Scholar 

  5. Hubert Comon. Completion of rewrite systems with membership constraints. Symbolic Computation, 25(4):397–453, 1998. Extends on a paper at ICALP’92.

    Article  MATH  MathSciNet  Google Scholar 

  6. Bruno Courcelle. The monadic second-order logic of graphs XIII: Graph drawings with edge crossings. Computational Intelligence, 244(1-2):63–94, 2000.

    MATH  MathSciNet  Google Scholar 

  7. Mary Dalrymple, Stuart Shieber, and Fernando Pereira. Ellipsis and higher-order unification. Linguistics & Philosophy, 14:399–452, 1991.

    Article  Google Scholar 

  8. Volker Diekert, Claudio Guterrez, and Christian Hagenah. The existential theory of equations with rational constraints in free groups is pspace-complete. In STACS 2001, volume 2010 of LNCS, pages 170–182, 2001.

    Chapter  Google Scholar 

  9. John Doner. Tree acceptors and some of their applications. Journal of Computer System Science, 4:406–451, 1970. Received December 1967, Revised May 1970.

    Article  MATH  MathSciNet  Google Scholar 

  10. Denys Duchier and Claire Gardent. Tree descriptions, constraints and incrementality. In Computing Meaning, volume 77 of Studies In Linguistics And Philosophy, pages 205–227. Kluwer Academic Publishers, 2001.

    Google Scholar 

  11. Markus Egg, Alexander Koller, and Joachim Niehren. The constraint language for lambda structures. Logic, Language, and Information, 10:457–485, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  12. Katrin Erk, Alexander Koller, and Joachim Niehren. Processing underspecified semantic representations in the constraint language for lambda structures. Journal of Language and Computation, 2002. To appear.

    Google Scholar 

  13. Katrin Erk and Joachim Niehren. Parallelism constraints. In RTA’ 00, volume 1833 of LNCS, pages 110–126, 2000.

    Google Scholar 

  14. Alexander Koller and Joachim Niehren. On underspecified processing of dynamic semantics. In 18th Int. Conf. on Computational Linguistics, pages 460–466, July 2000.

    Google Scholar 

  15. Alexander Koller, Joachim Niehren, and Ralf Treinen. Dominance constraints: Algorithms and complexity. In LACL’98, volume 2014 of LNAI, 2001.

    Google Scholar 

  16. Jordi Levy and Mateu Villaret. Linear second-order unification and context unification with tree-regular constraints. In RTA’00, volume 1833 of LNCS, pages 156–171, 2000.

    Google Scholar 

  17. Jordi Levy and Mateu Villaret. Context unification and traversal equations. In RTA’ 01, volume 2051 of LNCS, pages 167–184, 2001.

    Google Scholar 

  18. Mitchell P. Marcus, Donald Hindle, and Margaret M. Fleck. D-theory: Talking about talking about trees. In Proceedings of the 21st ACL, pages 129–136, 1983.

    Google Scholar 

  19. Joachim Niehren and Alexander Koller. Dominance constraints in context unification. In Logical Aspects of Computational Linguistics (1998), volume 2014 of LNAI, 2001.

    Google Scholar 

  20. Joachim Niehren and Mateu Villaret. On lambda binding, parallelism constraints and context unification, 2002. Available at http://www.ps.uni-sb.de/Papers.

  21. J. Rogers and K. Vijay-Shanker. Obtaining trees from their descriptions: An application to tree-adjoining grammars. Computational Intelligence, 10:401–421, 1994.

    Article  Google Scholar 

  22. M. Schmidt-Schauβ. A decision algorithm for stratified context unification. Technical Report F-rep.-12, FB Informatik, J.W. Goethe Universität Frankfurt, 1999.

    Google Scholar 

  23. Manfred Schmidt-Schauβ and Klaus U. Schulz. Solvability of context equations with two context variables is decidable. In CADE-16, LNAI, pages 67–81, 1999.

    Google Scholar 

  24. Klaus U. Schulz. Makanin’s algorithm for word equations-two improvements and a generalization. In Proceedings of the First International Workshop of Word Equations and Related Topics, volume 572 of LNCS, Tübingen, Germany, 1992.

    Google Scholar 

  25. J. W. Thatcher and J. B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2(1):57–81, 1967.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programming Systems Lab, Universität des Saarlandes, Saarbrücken, Germany

    Joachim Niehren

  2. IMA, Universitat de Girona, Campus de Montilivi, Girona, Spain

    Mateu Villaret

Authors
  1. Joachim Niehren
    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. Abteilung für Theoretische Informatik, Institut für Algebra und Diskrete Mathematik, Wiedner Hauptstr. 8-10, 1040, Wien, Austria

    Matthias Baaz

  2. Department of Computer Science, University of Manchester, Kilburn Building, Oxford Road, Manchester, M13, 9PL, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Niehren, J., Villaret, M. (2002). Parallelism and Tree Regular Constraints. In: Baaz, M., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2002. Lecture Notes in Computer Science(), vol 2514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36078-6_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-36078-6_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00010-5

  • Online ISBN: 978-3-540-36078-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation