1650 search results - page 101 / 330 » The HOM problem is decidable |
121
click to vote
CONCUR
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. We summarize and reorganize some of the last decade's research on real-time extensions of temporal logic. Our main focus is on tableau constructions for model checki...
113
Voted
ENDM
2010
15 years 4 months ago
2010
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
130
Voted
COMBINATORICS
2006
15 years 4 months ago
2006
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation w...
116
click to vote
JSYML
2008
15 years 3 months ago
2008
We describe which subdirectly irreducible flat algebras arise in the variety generated by an arbitrary class of flat algebras with absorbing bottom element. This is used to give an...
112
click to vote
JAR
2007
15 years 3 months ago
2007
Abstract. OWL DL, a new W3C ontology language recommendation, is based on the expressive description logic SHOIN. Although the ontology consistency problem for SHOIN is known to be...