Sciweavers

146 search results - page 9 / 30
» Data Complexity in the EL Family of Description Logics
Sort
View
KES
2007
Springer
14 years 1 months ago
Inductive Concept Retrieval and Query Answering with Semantic Knowledge Bases Through Kernel Methods
This work deals with the application of kernel methods to structured relational settings such as semantic knowledge bases expressed in Description Logics. Our method integrates a n...
Nicola Fanizzi, Claudia d'Amato
ICFCA
2007
Springer
13 years 11 months ago
A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data
Recent advances in data and knowledge engineering have emphasized the need for formal concept analysis (FCA) tools taking into account structured data. There are a few adaptations ...
Mohamed Rouane Hacene, Marianne Huchard, Amedeo Na...
AAAI
2010
13 years 9 months ago
Soundness Preserving Approximation for TBox Reasoning
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
Yuan Ren, Jeff Z. Pan, Yuting Zhao
CAISE
2004
Springer
14 years 1 months ago
Description Logics for Interoperability
tween documents. They should allow for an abstract representation of data which resembles the way they are actually perceived and used in the real world, thus shortening (with resp...
Enrico Franconi
DLOG
2006
13 years 9 months ago
Tableau Caching for Description Logics with Inverse and Transitive Roles
Abstract. Modern description logic (DL) reasoners are known to be less efficient for DLs with inverse roles. The current loss of performance is largely due to the missing applicabi...
Yu Ding, Volker Haarslev