5 search results - page 1 / 1 » Subsumption in KL-ONE is Undecidable |
KR
1989
Springer
13 years 9 months ago
1989
Springer
TIME
2007
IEEE
13 years 11 months ago
2007
IEEE
It is known that for temporal languages, such as firstorder LT L, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal des...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
We bring together two recent trends in description logic (DL): lightweight DLs in which the subsumption problem is tractable and conservative extensions as a central tool for forma...
JSC
2010
13 years 3 months ago
2010
We study the problem of deciding whether two ontologies are inseparable w.r.t. a signature Σ, i.e., whether they have the same consequences in the signature Σ. A special case is...
ECAI
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...