Sciweavers

53 search results - page 6 / 11
» Pinpointing in the Description Logic EL
Sort
View
DLOG
2011
12 years 11 months ago
The Complexity of Probabilistic EL
We analyze the complexity of subsumption in probabilistic variants of the description logic EL. In the case where probabilities apply only to concepts, we map out the borderline be...
Jean Christoph Jung, Víctor Gutiérre...
CADE
2006
Springer
14 years 8 months ago
CEL - A Polynomial-Time Reasoner for Life Science Ontologies
CEL (Classifier for EL) is a reasoner for the small description logic EL+ which can be used to compute the subsumption hierarchy induced by EL+ ontologies. The most distinguishing ...
Franz Baader, Carsten Lutz, Boontawee Suntisrivara...
TIME
2007
IEEE
14 years 2 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,...
DLOG
2008
13 years 10 months ago
Paraconsistent Reasoning for Expressive and Tractable Description Logics
Abstract. Four-valued description logic has been proposed to reason with description logic based inconsistent knowledge bases, mainly ALC. This approach has a distinct advantage th...
Yue Ma, Pascal Hitzler, Zuoquan Lin
IJCAI
2003
13 years 9 months ago
On the Undecidability of Description and Dynamic Logics with Recursion and Counting
The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierar­ chy of decidable logics with multiple maximal el­ ements. It would be desirable to ...
Piero A. Bonatti