Efficient description logic reasoning in Prolog: The DLog system. Traditional algorithms for Description Logic (DL) instance retrieval are inefficient for large amounts of underlying data. As DL is becoming more and more popular in areas such as the Semantic Web and information integration, it is very important to have systems which can reason efficiently over large data sets. In this paper we present an approach to transform DL axioms, formalised in the 𝒮ℋℐ𝒬 DL language, into a Prolog program under the unique name assumption. This transformation is performed with no knowledge about particular individuals: they are accessed dynamically during the normal Prolog execution of the generated program. This technique, together with the top-down Prolog execution, implies that only those pieces of data are accessed that are indeed important for answering the query. This makes it possible to store the individuals in a database instead of memory, which results in better scalability and helps in using DL ontologies directly on top of existing information sources. The transformation process consists of two steps: (1) the DL axioms are converted to first-order clauses of a restricted form, and (2) a Prolog program is generated from these clauses. Step (2), which is the focus of the present paper, actually works on more general clauses than those obtainable by applying step (1) to a 𝒮ℋℐ𝒬 knowledge base. We first present a base transformation, the output of which can be either executed using a simple interpreter or further extended to executable Prolog code. We then discuss several optimisation techniques, applicable to the output of the base transformation. Some of these techniques are specific to our approach, while others are general enough to be interesting for DL reasoner implementors not using Prolog. We give an overview of DLog, a DL reasoner in Prolog, which is an implementation of the techniques outlined above. We evaluate the performance of DLog and compare it to some widely used DL reasoners, such as RacerPro, Pellet and KAON2.
Keywords for this software
References in zbMATH (referenced in 7 articles )
Showing results 1 to 7 of 7.
- Zese, Riccardo; Bellodi, Elena; Riguzzi, Fabrizio; Cota, Giuseppe; Lamma, Evelina: Tableau reasoning for description logics and its extension to probabilities (2018)
- Pan, Jeff Z.; Ren, Yuan; Zhao, Yuting: Tractable approximate deduction for OWL (2016)
- Near, Joseph P.: From relational specifications to logic programs (2010)
- Zsombori, Zsolt: A resolution based description logic calculus (2010)
- Lukácsy, Gergely; Szeredi, Péter: Efficient description logic reasoning in prolog: the dlog system (2009) ioport
- Lukácsy, Gergely; Szeredi, Péter: Efficient description logic reasoning in Prolog: The DLog system (2009)
- Lukácsy, Gergely; Szeredi, Péter; Kádár, Balázs: Prolog based description logic reasoning (2008)