Preferred Explanations for Ontology-Mediated Queries under Existential Rules
Authors: İsmail İlkan Ceylan, Thomas Lukasiewicz, Enrico Malizia, Cristian Molinaro, Andrius Vaicenavičius6262-6270
AAAI 2021 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We provide a detailed complexity analysis for all the aforementioned problems, thereby providing a more complete picture for explaining query answers under existential rules. |
| Researcher Affiliation | Academia | Ismail Ilkan Ceylan1, Thomas Lukasiewicz1, Enrico Malizia2, Cristian Molinaro3, Andrius Vaicenaviˇcius1 1 Department of Computer Science, University of Oxford, UK 2 DISI, University of Bologna, Italy 3 DIMES, University of Calabria, Italy |
| Pseudocode | No | The paper does not contain pseudocode or algorithm blocks. It focuses on theoretical definitions and complexity analysis. |
| Open Source Code | No | The paper does not provide concrete access to source code for the described methodology. |
| Open Datasets | No | The paper is theoretical and does not involve training models on datasets. The examples used are illustrative, not empirical datasets. |
| Dataset Splits | No | The paper is theoretical and does not involve data splits for training, validation, or testing. |
| Hardware Specification | No | The paper does not provide specific hardware details used for running any experiments, as it is a theoretical work. |
| Software Dependencies | No | The paper does not mention any specific software dependencies with version numbers. |
| Experiment Setup | No | The paper is theoretical and does not include details about an experimental setup, hyperparameters, or training configurations. |