Complexity of Inconsistency-Tolerant Query Answering in Datalog+/– under Cardinality-Based Repairs
Authors: Thomas Lukasiewicz, Enrico Malizia, Andrius Vaicenavičius2962-2969
AAAI 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | This paper continues this line of research on cardinality-maximal consistent query answering, and we analyze the complexity of the above three inconsistency-tolerant query answering semantics for a wide range of Datalog languages and for several different complexity measures: |
| Researcher Affiliation | Academia | Thomas Lukasiewicz Department of Computer Science University of Oxford, UK Enrico Malizia Department of Computer Science University of Exeter, UK Andrius Vaicenaviˇcius Department of Computer Science University of Oxford, UK |
| Pseudocode | No | The paper does not contain any pseudocode or clearly labeled algorithm blocks. |
| Open Source Code | No | The paper does not provide any statements about releasing open-source code or links to a code repository. |
| Open Datasets | No | The paper is theoretical and does not describe training on datasets for empirical experiments. |
| Dataset Splits | No | The paper is theoretical and does not involve empirical validation on datasets, so no training/validation/test splits are mentioned. |
| Hardware Specification | No | The paper is theoretical and does not describe any specific hardware used for empirical experiments. |
| Software Dependencies | No | The paper is theoretical and does not list any specific software dependencies with version numbers for empirical experiments. |
| Experiment Setup | No | The paper is theoretical and does not provide details on an experimental setup, such as hyperparameters or training settings. |