1650 search results - page 133 / 330 » The HOM problem is decidable |
160
click to vote
IWCIA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
173
click to vote
FOSSACS
2001
Springer
15 years 8 months ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
178
click to vote
LPAR
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
139
click to vote
KR
1992
Springer
15 years 8 months ago
1992
Springer
Abstract, We consider the problem of integrating Reiter's default logic into terminological representation systems. It turns out that such an integration is less straightforwa...
149
click to vote
IPL
2007
15 years 4 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...