Sciweavers

42 search results - page 3 / 9
» Data Complexity of Query Answering in Expressive Description...
Sort
View
LPAR
2007
Springer
13 years 12 months ago
Data Complexity in the EL Family of Description Logics
We study the data complexity of instance checking and conjunctive query answering in the EL family of description logics, with a particular emphasis on the boundary of tractability...
Adila Krisnadhi, Carsten Lutz
DLOG
2006
13 years 7 months ago
Extending the SHOIQ(D) Tableaux with DL-safe Rules: First Results
On the Semantic Web, there has been increasing demand for a ruleslike expressivity that goes beyond OWL-DL. Efforts of combining rules languages and description logics usually pro...
Vladimir Kolovski, Bijan Parsia, Evren Sirin
JAPLL
2010
179views more  JAPLL 2010»
13 years 4 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...
JAR
2007
142views more  JAR 2007»
13 years 5 months ago
Reasoning in Description Logics by a Reduction to Disjunctive Datalog
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
KES
2007
Springer
13 years 12 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