Partial Grounded Fixpoints
Authors: Bart Bogaerts, Joost Vennekens, Marc Denecker
IJCAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | Approximation fixpoint theory (AFT) is an algebraical study of fixpoints of lattice operators. ... We apply our theory to logic programming and study complexity. ... Theorem 4.3. Given a finite propositional logic program P over Σ and an atom p Σ, the following hold. 1. The problem of deciding whether p holds in some partial grounded model of P is ΣP 2 -complete. 2. The problem of deciding whether p holds in all partial grounded models of P is in P. |
| Researcher Affiliation | Academia | Bart Bogaerts, Joost Vennekens, Marc Denecker Department of Computer Science, KU Leuven Celestijnenlaan 200A, 3001 Heverlee, Belgium {bart.bogaerts,joost.vennekens,marc.denecker}@cs.kuleuven.be |
| Pseudocode | No | The paper does not contain structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide any concrete access information for source code. |
| Open Datasets | No | The paper is theoretical and does not mention the use of publicly available or open datasets for training or evaluation. |
| Dataset Splits | No | The paper does not provide specific dataset split information (training, validation, test). |
| Hardware Specification | No | The paper does not provide specific hardware details used for running experiments, as it is a theoretical paper. |
| Software Dependencies | No | The paper does not provide specific ancillary software details with version numbers. |
| Experiment Setup | No | The paper does not contain specific experimental setup details, as it is a theoretical paper. |