Explanations for Query Answers under Existential Rules
Authors: İsmail İlkan Ceylan, Thomas Lukasiewicz, Enrico Malizia, Andrius Vaicenavičius
IJCAI 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | In this paper, we close this gap, and study the problem of explaining query answers in terms of minimal subsets of database facts. We provide a thorough complexity analysis for several decision problems associated with minimal explanations under existential rules. |
| Researcher Affiliation | Academia | Ismail Ilkan Ceylan1 , Thomas Lukasiewicz1 , Enrico Malizia2 and Andrius Vaicenaviˇcius1 1Department of Computer Science, University of Oxford, UK 2Department of Computer Science, University of Exeter, UK |
| Pseudocode | No | The paper does not contain structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide concrete access to source code. It mentions "All the proof details can be found in the extended version of this paper available from the authors," which is not a statement about code release. |
| Open Datasets | No | The paper is theoretical and does not involve experimental evaluation on a dataset; therefore, it does not provide access information for one. |
| Dataset Splits | No | The paper is theoretical and does not conduct experiments requiring dataset splits. |
| Hardware Specification | No | The paper is theoretical and does not describe experiments that would require specific hardware specifications. |
| Software Dependencies | No | The paper is theoretical and does not describe any software implementation, thus no specific ancillary software details are provided. |
| Experiment Setup | No | The paper is theoretical and does not describe any experimental setup details or hyperparameters. |