Strong Equivalence for Epistemic Logic Programs Made Easy
Authors: Wolfgang Faber, Michael Morak, Stefan Woltran2809-2816
AAAI 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | In this paper, we consider a simpler, more direct characterization that is directly applicable to the language used in state-of-the-art ELP solvers. This also allows us to give tight complexity bounds, showing that strong equivalence for ELPs remains co NP-complete, as for ASP. We further use our results to provide syntactic characterizations for tautological rules and rule subsumption for ELPs. |
| Researcher Affiliation | Academia | Wolfgang Faber, Michael Morak Alpen-Adria-Universit at Klagenfurt Klagenfurt, Austria Stefan Woltran TU Wien Vienna, Austria |
| Pseudocode | No | The paper does not contain structured pseudocode or algorithm blocks. It focuses on formal definitions, theorems, and proofs related to strong equivalence in logic programs. |
| Open Source Code | No | The paper does not provide concrete access to source code for the methodology described. It mentions existing ELP solving systems but does not offer code for its own theoretical contributions. |
| Open Datasets | No | The paper is theoretical and does not use datasets for training, validation, or testing. |
| Dataset Splits | No | The paper is theoretical and does not use datasets, therefore no training/test/validation dataset splits are provided. |
| Hardware Specification | No | The paper is theoretical and does not describe any experiments, thus no specific hardware details are provided. |
| Software Dependencies | No | The paper is theoretical and does not describe any experiments, thus no specific ancillary software details with version numbers are provided for replication. |
| Experiment Setup | No | The paper is theoretical and does not describe any experiments, thus no specific experimental setup details like hyperparameters or training configurations are provided. |