XPath for DL Ontologies
Authors: Egor Kostylev, Juan Reutter, Domagoj Vrgoc
AAAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | In this paper we make a step towards coupling knowledge bases and graph databases by studying how to answer powerful XPath-style queries over simple DLs like DL-Lite and EL. We start with adapting the definition of XPath to the DL context, and then proceed to study the complexity of evaluating XPath queries over knowledge bases. |
| Researcher Affiliation | Academia | Egor V. Kostylev University of Oxford Juan L. Reutter PUC Chile Domagoj Vrgoˇc PUC Chile |
| Pseudocode | No | The paper does not contain any structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide any information about open-source code availability for the described methodology. |
| Open Datasets | No | The paper is theoretical, analyzing formalisms (DL-Lite, EL families) and their complexity. It does not use or specify any concrete, publicly available datasets. |
| Dataset Splits | No | The paper is theoretical and does not involve experimental data splits. Therefore, it does not provide training/validation/test dataset splits. |
| Hardware Specification | No | The paper focuses on theoretical complexity analysis and does not describe any specific hardware used for experiments. |
| Software Dependencies | No | The paper focuses on theoretical complexity analysis and does not list any specific software components with version numbers. |
| Experiment Setup | No | The paper is theoretical, discussing formalisms and complexity, and therefore does not describe specific experimental setup details such as hyperparameters or training settings. |