Sciweavers

441 search results - page 30 / 89
» Automated Benchmarking of Description Logic Reasoners
Sort
View
CADE
2007
Springer
14 years 10 months ago
Conservative Extensions in the Lightweight Description Logic EL
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...
Carsten Lutz, Frank Wolter
DLOG
2010
13 years 7 months ago
Optimal Rewritings in Definitorially Complete Description Logics
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 . ...
Inanç Seylan, Enrico Franconi, Jos de Bruij...
TIME
2007
IEEE
14 years 3 months ago
Temporalising Tractable Description Logics
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...
Alessandro Artale, Roman Kontchakov, Carsten Lutz,...
KR
1998
Springer
14 years 1 months ago
Using an Expressive Description Logic: FaCT or Fiction?
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...
Ian Horrocks
DLOG
2007
13 years 12 months ago
Distributed Description Logics Revisited
Distributed Description Logics (DDLs) is a KR formalism that enables reasoning with multiple ontologies interconnected by directional semantic mapping (bridge rules). DDLs capture ...
Martin Homola