Sciweavers

1545 search results - page 69 / 309
» Defeasible Description Logics
Sort
View
AAAI
2007
13 years 10 months ago
Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
Diego Calvanese, Thomas Eiter, Magdalena Ortiz
JAR
2007
129views more  JAR 2007»
13 years 7 months ago
A Tableau Algorithm for Description Logics with Concrete Domains and General TBoxes
To use description logics (DLs) in an application, it is crucial to identify a DL that is sufficiently expressive to represent the relevant notions of the application domain, but f...
Carsten Lutz, Maja Milicic
DLOG
1998
13 years 9 months ago
Comparing Subsumption Optimizations
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence...
Ian Horrocks, Peter F. Patel-Schneider
ECSQARU
2009
Springer
14 years 2 months ago
Supporting Fuzzy Rough Sets in Fuzzy Description Logics
Abstract. Classical Description Logics (DLs) are not suitable to represent vague pieces of information. The attempts to achieve a solution have lead to the birth of fuzzy DLs and r...
Fernando Bobillo, Umberto Straccia
LPAR
2007
Springer
14 years 2 months ago
Complexity of Planning in Action Formalisms Based on Description Logics
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...
Maja Milicic