Published: 2007 Juni
Herausgeber: D. Calvanese, E. Franconi, V. Haarslev, D. Lembo, B. Motik, A.-Y. Turhan and S. Tessaris
Buchtitel: Proceedings of the 20th International Workshop on Description Logics (DL2007)
Verlag: CEUR Workshop Proceedings
EL++ is a rather expressive description logic (DL) that still admits polynomial time inferencing for many reasoning tasks. Conjunctive queries are an important means for expressive querying on DL knowledge bases. In this paper, we address the problem of computing conjunctive query entailment for EL++ knowledge bases. As it turns out, querying unrestricted EL++ is actually undecidable, but we identify restrictions under which query answering becomes decidable and even tractable. To the best of our knowledge, the presented algorithm is the first to answer conjunctive queries in a description logic that admits general role inclusion axioms.
Weitere Informationen unter: Link, Link, Link