109 search results - page 9 / 22 » Exploiting Conjunctive Queries in Description Logic Programs |
110
click to vote
CADE
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. While there has been a great deal of work on the development of reasoning algorithms for expressive description logics, in most cases only Tbox reasoning is considered. I...
IAT
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
113
click to vote
ECAI
2010
Springer
15 years 29 days ago
2010
Springer
Abstract. The deployment of KR formalisms to the Web has created the need for formalisms that combine heterogeneous knowledge bases. Nonmonotonic dl-programs provide a loose integr...
119
click to vote
DLOG
2011
14 years 3 months ago
2011
We prove co-N2ExpTime-hardness for conjunctive query entailment in the description logic ALCOIF , thus improving the previously known 2ExpTime lower bound. The result transfers to ...
154
click to vote
HIS
2009
14 years 9 months ago
2009
Recent years have witnessed the wide recognition of the importance of ontology and rule in the AI research. In this paper, we report our implementation and evaluation of a rule-ba...