Efficient Description Logic Reasoning in Prolog: The DLog system
|
Descargar SCORM
¡Sea el primero en solicitar este recurso!
Para poder solicitar este recurso debe identificarse como usuario de la biblioteca
|
| |
Ver
Detalles del recurso
|
|
|
Efficient Description Logic Reasoning in Prolog: The DLog system
|
| Id. |
46049667 |
| Idioma |
inglés
|
| Titulo |
Efficient Description Logic Reasoning in Prolog: The DLog system |
| Autor(es) |
Gergely Lukácsy
Péter Szeredi
|
| Localización |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.8364
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
Traditional algorithms for description logic (DL) instance retrieval are inefficient for large amounts of underlying data. As description logic is becoming popular in areas such as the Semantic Web and information integration, it is very important to have systems that can reason efficiently over large data sets. In this paper we present an approach to transform description logic axioms described in the SHIQ DL language into a Prolog program. This transformation is done without any knowledge on the 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 which are indeed important for answering the query. This allows us to store the individuals in a database instead of memory, which results in better scalability and helps using description logic ontologies directly on top of existing information sources. The transformation process consists of two steps: (1) first we create FOL clauses of restricted form from the DL axioms, (2) then we generate a Prolog program from these. 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 $\mathcal{SHIQ}$ 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.
|
| Tipo |
application/pdf
|
| Palabras clave |
description logic
|
| Tipo de recurso |
Texto Narrativo
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
|
Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Formatos |
application/pdf
|
| Requerimientos técnicos |
Browser: Any
|
| Relación |
[IsBasedOn] http://mycite.omikk.bme.hu/doc/14564.pdf
[References] 10.1.1.11.4071
[References] 10.1.1.105.4755
[References] 10.1.1.21.2628
[References] 10.1.1.64.5009
[References] 10.1.1.40.3689
[References] 10.1.1.77.9548
[References] 10.1.1.12.5026
[References] 10.1.1.88.5990
[References] 10.1.1.31.3094
[References] 10.1.1.97.533
[References] 10.1.1.100.2751
[References] 10.1.1.59.4227
[References] 10.1.1.45.1496
[References] 10.1.1.107.3707
[References] 10.1.1.14.1594
[References] 10.1.1.2.318
[References] 10.1.1.23.1668
[References] 10.1.1.62.2929
[References] 10.1.1.105.3703
[References] 10.1.1.5.649
[References] 10.1.1.18.9340
|
| Fecha de contribución |
02-oct-2009 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
