Consistent Query Answering over Existential Rules with Open and Closed Predicates
Authors: Lorenzo Marconi, Riccardo Rosati
AAAI 2025 | Venue PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We establish the data complexity of answering unions of conjunctive queries in such a new framework under the so-called AR semantics and for different classes of existential rules. We also provide new complexity results for the standard (i.e. non-inconsistency tolerant) query answering in the presence of both open and closed predicates. Our analysis focuses on different classes of existential rules. The main implications of our findings (which are summarized in Table 1 and Table 2) are the following: not surprisingly, in most of the cases considered, the presence of both open and closed predicates (and in particular of both open-head and closed-head rules) significantly increases the complexity of the two query entailment problems compared to cases where predicates are either all open or all closed. |
| Researcher Affiliation | Academia | DIAG, Sapienza University of Rome EMAIL |
| Pseudocode | Yes | Algorithm 1: expand Algorithm 2: OC-Ent-A+C* |
| Open Source Code | No | The paper does not mention the release of source code, provide a repository link, or state that code is available in supplementary materials. The paper primarily focuses on theoretical complexity results. |
| Open Datasets | No | The paper presents a theoretical framework and complexity analysis for Consistent Query Answering over existential rules. It does not refer to any specific publicly available or open datasets used for empirical evaluation. |
| Dataset Splits | No | The paper is theoretical and does not involve empirical experiments with datasets, therefore, no dataset split information is provided. |
| Hardware Specification | No | The paper is theoretical and focuses on complexity analysis; it does not describe any experiments that would require specific hardware, thus no hardware specifications are provided. |
| Software Dependencies | No | The paper is theoretical and does not provide details on software implementations or dependencies with version numbers. |
| Experiment Setup | No | The paper is theoretical, presenting complexity results and mathematical properties. It does not include any experimental setup details, hyperparameters, or training configurations. |