2944 search results - page 6 / 589 » On Well Quasi-orders on Languages |
155
click to vote
CADE
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...
134
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
150
click to vote
ICALP
2005
Springer
16 years 4 days ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
298
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
When interval methods handle systems of equations over the reals, two main types of filtering/contraction algorithms are used to reduce the search space. When the system is well-co...
190
click to vote
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
The seemingly simple choice of whether to use call variance or call subsumption in a tabled evaluation deeply affects an evaluation’s properties. Most tabling implementations hav...