744 search results - page 30 / 149 » Observations on the Decidability of Transitions |
156
click to vote
MST
2006
15 years 1 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
101
click to vote
FOSSACS
2010
Springer
15 years 8 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-...
138
click to vote
LPAR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The Description Logics underpinning OWL impose a well-known syntactic restriction in order to preserve decidability: they do not allow to use nonsimple roles—that is, t...
139
click to vote
CSL
2008
Springer
15 years 3 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
135
click to vote
CLIMA
2010
15 years 2 months ago
2010
When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballo...