124 search results - page 13 / 25 » The Undecidability of the Generalized Collatz Problem |
CADE
2006
Springer
14 years 7 months ago
2006
Springer
We investigate whether identification constraints such as keys and functional dependencies can be granted full status as a concept constructor in a Boolean-complete description log...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We define stochastic timed games, which extend two-player timed games with probabilities (following a recent approach by Baier et al), and which extend in a natural way continuous-...
LFCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” whic...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
We consider deducibility constraints, which are equivalent to particular Diophantine systems, arising in the automatic verification of security protocols, in presence of associati...
ACL
2006
13 years 8 months ago
2006
Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unificati...