1650 search results - page 86 / 330 » The HOM problem is decidable |
COCO
2010
Springer
14 years 2 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
CADE
2003
Springer
14 years 10 months ago
2003
Springer
In this paper we present a translation principle, called the axiomatic translation, for reducing propositional modal logics with background theories, including triangular propertie...
CSL
2009
Springer
14 years 4 months ago
2009
Springer
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
FSTTCS
2009
Springer
14 years 4 months ago
2009
Springer
Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running sys...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract— A fully-distributed collaborative multi-target tracking framework that eliminates the need for a central data associator or a central coordinating node for wireless sen...