Partitioning ABoxes Based on Converting DL to Plain Datalog
نویسندگان
چکیده
To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reasoning can be performed separately on each partition and the results trivially combined can achieve complete answers. Our method applies to SHIQ(D) knowledge bases. It first converts a DL knowledge base KB to a plain datalog program H(KB), and then computes the least fixpoint of the definite part of H(KB) while generating ABox partitions. Its time data complexity is polynomial in the ABox size, under some general assumption on concrete domains. Experimental results further demonstrate the advantages
منابع مشابه
Resolution-Based Reasoning for Ontologies
We overview the algorithms for reasoning with description logic (DL) ontologies based on resolution. These algorithms often have worst-case optimal complexity, and, by relying on vast experience in building resolution theorem provers, they can be implemented efficiently. Furthermore, we present a resolution-based algorithm that reduces a DL knowledge base into a disjunctive datalog program, whi...
متن کاملA Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes
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 pr...
متن کاملGoal-oriented Type-based Reasoning for Expressive DLs
Reasoning in expressive Description Logics (DLs) that contain ALC is challenging, partly because they do not enjoy the useful universal model property of their Horn counterparts. There are efficient state-of-the-art reasoners for standard reasoning tasks, but they are still lacking for other tasks that do not reduce easily to satisfiability. For instance, for query answering, there are a few al...
متن کاملO wl O nt DB: A Scalable Reasoning System for OWL 2 RL Ontologies with Large ABoxes
Ontologies are becoming increasingly important in largescale information systems such as healthcare systems. Ontologies can represent knowledge from clinical guidelines, standards, and practices used in the healthcare sector and may be used to drive decision support systems for healthcare, as well as store data (facts) about patients. Reallife ontologies may get very large (with millions of fac...
متن کاملDatalog Rewriting Techniques for Non-Horn Ontologies
We study the closely related problems of rewriting disjunctive datalog programs and non-Horn DL ontologies into plain datalog programs that entail the same facts for every dataset. We first propose the class of markable disjunctive datalog programs, which is efficiently recognisable and admits polynomial rewritings into datalog. Markability naturally extends to SHI ontologies, and markable onto...
متن کامل