Polynomial Rewritings for Linear Existential Rules
Authors: Georg Gottlob, Marco Manna, Andreas Pieris
IJCAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We establish that linear existential rules are polynomially combined rewritable, while full linear rules are polynomially (purely) rewritable; in both cases, the target query language consists of first-order or non-recursive Datalog queries. [...] The results of this work are, for the moment, of theoretical nature and we do not claim that they will directly lead to better practical algorithms. |
| Researcher Affiliation | Academia | 1Department of Computer Science, University of Oxford, UK 2Department of Mathematics and Computer Science, University of Calabria, Italy 3Institute of Information Systems, Vienna University of Technology, Austria |
| Pseudocode | No | The paper describes formal definitions and query constructions, but does not include any clearly labeled 'Pseudocode' or 'Algorithm' blocks, nor does it present structured steps in a code-like format. |
| Open Source Code | No | The paper does not contain any statement or link regarding the release of source code for the methodology described. |
| Open Datasets | No | The paper is theoretical and does not describe or use any datasets, public or otherwise. |
| Dataset Splits | No | The paper is theoretical and does not involve experiments, therefore it does not mention training/test/validation dataset splits. |
| Hardware Specification | No | The paper is theoretical and does not report on experimental setups, thus no hardware specifications are mentioned. |
| Software Dependencies | No | The paper is theoretical and does not discuss software implementations or dependencies with version numbers. |
| Experiment Setup | No | The paper is theoretical and does not describe any experimental setup details or hyperparameters. |