1650 search results - page 72 / 330 » The HOM problem is decidable |
152
click to vote
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We study the synthesis problem for external linear or branching specifications and distributed, synchronous architectures with arbitrary delays on processes. External mea...
146
click to vote
WG
2004
Springer
15 years 9 months ago
2004
Springer
We consider the NP-complete problem of deciding whether an input graph on n vertices has k vertex-disjoint copies of a fixed graph H. For H = K3
115
click to vote
ADG
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Geometric straight-line programs [5, 8] can be used to model geometric constructions and their implicit ambiguities. In this paper we discuss the complexity of deciding w...
135
click to vote
KR
2000
Springer
15 years 7 months ago
2000
Springer
We present a new tableaux calculus deciding the ABox consistency problem for the expressive description logic ALCNHR+ . Prominent language features of ALCNHR+ are number restricti...
129
click to vote
DLOG
2007
15 years 6 months ago
2007
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...