441 search results - page 30 / 89 » Automated Benchmarking of Description Logic Reasoners |
179
click to vote
CADE
2007
Springer
16 years 6 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...
146
click to vote
DLOG
2010
15 years 3 months ago
2010
In this paper, we revisit the problem of definitorial completeness, i.e., whether a given general TBox T in a description logic (DL) L can be rewritten to an acyclic TBox T in L . ...
177
click to vote
TIME
2007
IEEE
16 years 2 days 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...
148
click to vote
KR
1998
Springer
15 years 10 months ago
1998
Springer
Description Logics form a family of formalisms closely related to semantic networks but with the distinguishing characteristic that the semantics of the concept description langua...
184
click to vote
DLOG
2007
15 years 8 months ago
2007
Distributed Description Logics (DDLs) is a KR formalism that enables reasoning with multiple ontologies interconnected by directional semantic mapping (bridge rules). DDLs capture ...