1650 search results - page 36 / 330 » The HOM problem is decidable |
ESOP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We present a generic algorithm for solving Horn clauses through iterative specialisation. The algorithm is generic in the sense that it can be instantiated with any decid...
CADE
2012
Springer
11 years 10 months ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
ALDT
2009
Springer
13 years 11 months ago
2009
Springer
We study the problem of allocating a set of indivisible goods to a set of agents having additive preferences. We introduce two new important complexity results concerning efficienc...
EJC
2008
13 years 7 months ago
2008
We study certain constraint satisfaction problems which are the problems of deciding whether there exists a homomorphism from a given relational structure to a fixed structure with...
HYBRID
2007
Springer
14 years 1 months ago
2007
Springer
This paper addresses questions regarding the decidability of hybrid automata that may be constructed hierarchically and in a modular way, as is the case in many exemplar systems, b...