146 search results - page 1 / 30 » Data Complexity in the EL Family of Description Logics |
LPAR
2007
Springer
13 years 11 months ago
2007
Springer
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...
KR
2010
Springer
13 years 9 months ago
2010
Springer
We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence...
JAPLL
2010
13 years 3 months ago
2010
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 ...
DLOG
2007
13 years 7 months ago
2007
KI
2007
Springer
13 years 11 months ago
2007
Springer
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...