## i pels meus paresContents

### BibTeX

@MISC{Superior_ipels,

author = {Consell Superior and Mateu Villaret I Auselle and Foreword Jordi Levy and Jordi Levy and Mateu Villaret and Departament D’informàtica I Matemàtica Aplicada and Consell Superior},

title = {i pels meus paresContents},

year = {}

}

### OpenURL

### Abstract

Number 22

### Citations

172 |
Generalized finite automata theory with an application to a decision problem of second-order logic
- Thatcher, Wright
- 1968
(Show Context)
Citation Context ...l X, A ∈ V we have that α(X) ∈ nodesτ and α(A) ∈ 2 nodesτ . The language of Monadic Second-Order Dominance Logic is closely related to the Weak Monadic Second-Order Logic of the complete binary tree (=-=Thatcher and Wright, 1967-=-; Doner, 1970). This was first noticed by Backofen et al. (1995). The models of Monadic Second-Order Dominance Logic are ground terms while the only model of the Weak Monadic Second-Order Logic is the... |

76 |
Hypsometric (area-altitude) analysis of erosional topography
- Strahler
- 1952
(Show Context)
Citation Context ...s.5.1. Introduction 73 Nahum Dershowitz made us notice that this notion was already defined for trees under the name of order and can be computed by the so-called HortonStrahler rules (Horton, 1945; =-=Strahler, 1952-=-). The measure is one of the results of the attempts of the geologists to quantify the morphological descriptions of river networks. They intend to reflect, in a quantitative way, the intuitive notion... |

35 |
Makanin’s algorithm for word equations - two improvements and a generalization
- Schulz
- 1990
(Show Context)
Citation Context ...n. Nevertheless, some people believe that Word Unification is in NP. It has also been proved that word equations, where variables can be constrained to belong to regular languages, is also decidable (=-=Schulz, 1991-=-). Several attempts to simplify Makanin’s proof and trying to give a practical implementation of the algorithm, have been made (Jaffar, 1990; Schulz, 1993). Expressiveness of word equations has also b... |

32 |
Universal Unification
- Siekmann
- 1984
(Show Context)
Citation Context ...C-Unification (i.e. AssociativeCommutative Unification), D-Unification (i.e. Distributive Unification), and A-Unification (i.e. Associative Unification). For a good summarisation of EUnification see (=-=Siekmann and Szabó, 1984-=-) and (Baader and Siekmann, 1993). A-unification is of special interest to us because it corresponds to the well known Word Unification Problem, shown to be decidable by Makanin (1977). 1.1.3 Word Uni... |

27 |
On the exponent of periodicity of minimal solutions of context equation. volume 1379
- Schmidt-Schauß, Schulz
- 1998
(Show Context)
Citation Context ...e context must be placed. This perspective is the one followed, for instance, in (Comon, 1992a), where Context Unification is used in completion for some rewrite systems, or in (Schmidt-Schauß, 1996; =-=Schmidt-Schauß and Schulz, 1998-=-, 1999, 2002b), where, just to mention one, Schmidt-Schauß (1996) uses a decidable fragment of Context Unification to prove decidability of Distributive Unification. 2. From the “Second-Order Unificat... |

26 | Solvability of context equations with two context variables is decidable
- Schmidt-Schauß, Schulz
(Show Context)
Citation Context ...000). Although its decidability is still an open question, the fact that some subclasses that are undecidable in Second-Order Unification have been shown decidable in Context Unification (Levy, 1996; =-=Schmidt-Schauß and Schulz, 1999-=-), supports the common belief that Context Unification is decidable. When variables are allowed to be instantiated by terms where bound variables can occur in the body of the term a bounded number of ... |

21 | Word unification and transformation of generalized equations - Schulz - 1993 |

17 | A decision algorithm for stratified context unification - Schmidt-Schauß |

15 | On the Complexity of Linear and Stratified Context Matching Problems”. Unpublished manuscript
- Schmidt-Schauß, Stuber
(Show Context)
Citation Context .... • Salvati and de Groote (2003), show that Linear Second-Order Matching under Comon’s restriction is NP -complete, contrasting with the fact that Context Matching under the same restriction is in P (=-=Schmidt-Schauß and Stuber, 2002-=-). The main reason for this difference is that the order in which the arguments of second-order variables are abstracted in Linear Second-Order Matching, does not need to correspond to the order in wh... |

15 | Interaction of scope and ellipsis
- Shieber, Pereira, et al.
- 1996
(Show Context)
Citation Context ...n any naive sense. In fact, this constitutes a serious problem to Linear Second-Order Unification or other kinds of Higher-Order Unification approaches dealing with ellipsis resolution (Pinkal, 1995; =-=Shieber et al., 1996-=-). One might hope for instance, to describe the first reading above through the following lambda term: @(@(exists, taxi), λt.@(@(and, C(john)), C(bill))) (7.1)7.4. The Non-intervenance Property 129 w... |

14 | Second-order unification and type inference for Church-style polymorphism
- Schubert
(Show Context)
Citation Context ...Unification fragments like the Stratified one or the one of two distinct context variables, which when considered as Second-Order Unification are undecidable (Levy, 1998; Levy and Veanes, 1998, 2000; =-=Schubert, 1998-=-) (see Section 2.2), and when considered as Context Unification become decidable (Schmidt-Schauß, 1996, 1998, 1999b, 2002; Schmidt-Schauß and Schulz, 1999, 2002b) (see Section 3.3), also supports this... |

7 | Decidability of bounded higher-order unification - Schmidt-Schauß, Schulz - 2005 |

5 |
Complexity of the Unification Algorithm for firstOrder Expressions
- Venturini-Zilli
- 1975
(Show Context)
Citation Context ...ons have first-order types, then the problem is simply FirstOrder Unification, that as we have already said in the Introduction Chapter, it is decidable (Martelli and Montanari, 1976; Robinson, 1965; =-=Venturini-Zilli, 1975-=-). 2.4.2 Pattern Unification In mathematics, one often define functions by an equation of the following shape: F (x, y) = x · x + y · y and we actually mean that F is a function that has two arguments... |

4 | Decidability of Bounded Second-Order Unification - Schmidt-Schauß - 2004 |