Structural Decompositions of Epistemic Logic Programs
Authors: Markus Hecher, Michael Morak, Stefan Woltran2830-2837
AAAI 2020 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | In this paper, we give first results in this direction and show that central ELP problems can be solved in linear time for ELPs exhibiting structural properties in terms of bounded treewidth. We also provide a full dynamic programming algorithm that adheres to these bounds. Finally, we show that applying treewidth to a novel dependency structure given in terms of epistemic literals allows to bound the number of ASP solver calls in typical ELP solving procedures. |
| Researcher Affiliation | Academia | Markus Hecher,1,2 Michael Morak,3 Stefan Woltran1 1TU Wien, Vienna, Austria, 2University of Potsdam, Potsdam, Germany 3University of Klagenfurt, Klagenfurt, Austria {hecher, woltran}@dbai.tuwien.ac.at, michael.morak@aau.at |
| Pseudocode | Yes | Listing 1: Bag algorithm EPRIM(t, χt, ΠE t , τ1, . . . ) for nice TDs of the epistemic primal graph representation. Listing 2: Bag algorithm PRIM(t, χt, Πt, τ1, . . . ) for nice TDs of the primal graph representation. |
| Open Source Code | No | The paper does not provide any statement or link indicating that the source code for the described methodology is publicly available. |
| Open Datasets | No | The paper mentions 'scholarship eligibility (SE) benchmark set' and 'EPASP (Son et al. 2017)' but does not provide concrete access information (link, DOI, specific repository, or full citation with author/year for a dataset) for any dataset used for training or evaluation. It describes a problem instance, not a dataset per se. |
| Dataset Splits | No | This theoretical paper focuses on complexity analysis and algorithm design. It does not describe any experimental setup that would involve training, validation, or test splits of data. |
| Hardware Specification | No | The paper does not specify any hardware used for experiments as it is a theoretical paper. |
| Software Dependencies | No | The paper refers to 'ASP solver' and 'EPASP' but does not provide specific version numbers for any software dependencies. |
| Experiment Setup | No | This theoretical paper focuses on complexity analysis and algorithm design. It does not describe an experimental setup with specific hyperparameters or training configurations. |