107 citations · 174 across the 12 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.LO2010★ 107 cited
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma
Diego Figueira, Santiago Figueira, Sylvain Schmitz +1
Dickson's Lemma is a simple yet powerful tool widely used in termination proofs, especially when dealing with counters or related data structures. However, most computer scientists…
cs.LO2010★ 1 cited
The Question of Expressiveness in the Generation of Referring Expressions
Carlos Areces, Santiago Figueira, Daniel Gorín
We study the problem of generating referring expressions modulo different notions of expressive power. We define the notion of $\+L$-referring expression, for a formal language $\+…