Many modern applications of description logics (DLs) require answering queries over large data quantities, structured according to relatively simple ontologies. For such applications, we conjectured that reusing ideas of deductive databases might improve scalability of DL systems. Hence, in our previous work, we developed an algorithm for reducing a DL knowledge base to a disjunctive datalog program. To test our conjecture, we implemented our algorithm in a new DL reasoner KAON2, which we des...Expand abstract
- Publisher copy:
- Copyright date:
A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes.
Views and Downloads
If you are the owner of this record, you can report an update to it here: Report update to this record