Answering Queries with Negation over Existential Rules
Authors: Stefan Ellmauthaler, Markus Krötzsch, Stephan Mennicke5626-5633
AAAI 2022 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We therefore propose universal core models as a basis for a meaningful (non-monotonic) semantics for queries with negation. Since cores are hard to compute, we identify syntactic conditions (on rules and queries) under which our core-based semantics can equivalently be obtained for other universal models, such as those produced by practical chase algorithms. Finally, we use our findings to propose a semantics for a broad class of existential rules with negation. |
| Researcher Affiliation | Academia | Knowledge-Based Systems Group, TU Dresden, Dresden, Germany |
| Pseudocode | No | The paper contains definitions, theorems, and proofs but no structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not mention providing open-source code for the described methodology. |
| Open Datasets | No | The paper is theoretical and does not refer to the use of any specific dataset for training. |
| Dataset Splits | No | The paper is theoretical and does not mention dataset splits for training, validation, or testing. |
| Hardware Specification | No | The paper is theoretical and does not describe any experiments, therefore no hardware specifications are mentioned. |
| Software Dependencies | No | The paper is theoretical and does not specify software dependencies with version numbers for experimental setup. |
| Experiment Setup | No | The paper is theoretical and does not describe any experimental setup or hyperparameters. |