1650 search results - page 91 / 330 » The HOM problem is decidable |
TIME
2008
IEEE
14 years 4 months ago
2008
IEEE
We survey temporal description logics that are based on standard temporal logics such as LTL and CTL. In particular, we concentrate on the computational complexity of the satisfi...
COCO
2007
Springer
14 years 4 months ago
2007
Springer
There exists a positive constant α < 1 such that for any function T(n) ≤ nα and for any problem L ∈ BPTIME(T(n)), there exists a deterministic algorithm running in poly(T...
VSTTE
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The Verifying Compiler checks the correctness of the program it compiles. The workhorse of such a tool is the reasoning engine, which decides validity of formulae in a su...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
An induced packing of odd cycles in a graph is a packing such that there is no edge in a graph between any two odd cycles in the packing. We prove that the problem is solvable in t...
FOSSACS
2006
Springer
14 years 1 months ago
2006
Springer
We consider parity games played on special pushdown graphs, namely those generated by one-counter processes. For parity games on pushdown graphs, it is known from [22] that decidin...