Tractable query answering for description logics via query rewriting
We consider the problem of answering conjunctive queries over description logic knowledge bases via query rewriting. Given a conjunctive query Q and a TBox T, we compute a new query Q′ that incorporates the semantic consequences of T such that, for any ABox A, evaluating Q over T and A can be done b...
Autori principali: | , |
---|---|
Altri autori: | |
Natura: | Tesi |
Lingua: | English |
Pubblicazione: |
2010
|
Soggetti: |