341 search results - page 7 / 69 » Paired bondage in trees |
WOLLIC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We introduce a tree-sequent calculus for inquisitive logic (Groenendijk 2008) as a special form of labelled deductive system (Gabbay 1996). In particular, we establish th...
COMBINATORICS
2006
14 years 9 months ago
2006
A permutation is said to avoid the permutation if no subsequence in has the same order relations as . Two sets of permutations 1 and 2 are Wilfequivalent if, for all n, the numb...
91
Voted
CADE
2009
Springer
15 years 10 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
ACL
2012
13 years 1 days ago
2012
We propose an improved, bottom-up method for converting CCG derivations into PTB-style phrase structure trees. In contrast with past work (Clark and Curran, 2009), which used simp...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...