1650 search results - page 134 / 330 » The HOM problem is decidable |
232
click to vote
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
To address the needs of data intensive XML applications, a number of efficient tree pattern algorithms have been proposed. Still, most XQuery compilers do not support those algori...
141
click to vote
CPAIOR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
121
click to vote
FOSSACS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Spatial logics have been introduced to reason about distributed computation in models for concurrency. We first define a spatial logic for a general class of infinite-...
160
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
147
click to vote
APN
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study data nets, a generalisation of Petri nets in which tokens carry data from linearlyordered infinite domains and in which whole-place operations such as resets an...