Parallelism and Tree Regular Constraints

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.

[1]  Claire Gardent,et al.  Tree Descriptions, Constraints and Incrementality , 2001 .

[2]  H. Comon.  Completion of Rewrite Systems with Membership Constraints Part I: Deduction Rules☆ , 1998 .

[3]  Joachim Niehren,et al.  Beta Reduction Constraints , 2001, RTA.

[4]  Manfred Schmidt-Schauß,et al.  A Decision Algorithm for Stratified Context Unification , 2002, J. Log. Comput..

[5]  Bruno Courcelle.  The monadic second-order logic of graphs XIII: Graph drawings with edge crossings , 2000, Theor. Comput. Sci..

[6]  Jordi Levy,et al.  Linear Second-Order Unification and Context Unification with Tree-Regular Constraints , 2000, RTA.

[7]  Klaus U. Schulz,et al.  Makanin's Algorithm for Word Equations - Two Improvements and a Generalization , 1990, IWWERT.

[8]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[9]  Joachim Niehren,et al.  Parallelism Constraints , 2000, RTA.

[10]  Joachim Niehren,et al.  Dominance Constraints in Context Unification , 1998, LACL.

[11]  Hubert Comon-Lundh,et al.  Completion of Rewrite Systems with Membership Constraints , 1992, ICALP.

[12]  Volker Diekert,et al.  The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete , 2001, STACS.

[13]  Kurt Mehlhorn,et al.  An efficient algorithm for the configuration problem of dominance graphs , 2001, SODA '01.

[14]  Stuart M. Shieber,et al.  Ellipsis and higher-order unification , 1991 .

[15]  Joachim Niehren,et al.  Processing Underspecified Semantic Representations in the Constraint Language for Lambda Structures , 2003 .

[16]  Joachim Niehren,et al.  Underspecified Beta Reduction , 2001, ACL.

[17]  Joachim Niehren,et al.  The Constraint Language for Lambda Structures , 2001, J. Log. Lang. Inf..

[18]  Joachim Niehren,et al.  Dominance Constraints: Algorithms and Complexity , 1998, LACL.

[19]  Joachim Niehren,et al.  On Underspecified Processing of Dynamic Semantics , 2000, COLING.

[20]  Jordi Levy,et al.  Context Unification and Traversal Equations , 2001, RTA.

[21]  Klaus U. Schulz.  Word Equations and Related Topics , 1990, Lecture Notes in Computer Science.

[22]  Klaus U. Schulz,et al.  Solvability of Context Equations with Two Context Variables is Decidable , 1999, CADE.

[23]  James Rogers,et al.  OBTAINING TREES FROM THEIR DESCRIPTIONS: AN APPLICATION TO TREE‐ADJOINING GRAMMARS , 1994, Comput. Intell..

[24]  Rolf Backofen,et al.  A first-order axiomatization of the theory of finite trees , 1995, J. Log. Lang. Inf..

[25]  Mitchell P. Marcus,et al.  D-Theory: Talking about Talking about Trees , 1983, ACL.

[26]  Joachim Niehren,et al.  On Lambda Binding Constraints and Context Unification , 2022 .