Complexity Results in Epistemic Planning
Authors: Thomas Bolander, Martin Holm Jensen, Francois Schwarzentruber
IJCAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We provide complexity results on the plan existence problem for multi-agent planning tasks, focusing on purely epistemic actions with propositional preconditions. |
| Researcher Affiliation | Academia | Thomas Bolander DTU Compute Tech. University of Denmark Copenhagen, Denmark tobo@dtu.dk Martin Holm Jensen DTU Compute Tech. University of Denmark Copenhagen, Denmark martin.holm.j@gmail.com Francois Schwarzentruber IRISA ENS Rennes Rennes, France francois.schwarzentruber@ens-rennes.fr |
| Pseudocode | Yes | Figure 3: Non-deterministic algorithm for the plan existence problem. procedure Plan Exists (s0, {α1, . . . , αm}, ϕg), B a) Guess a vector (k1, . . . , km) {0, . . . , B}m. b) Accept when s0 |= α1 k1 αm kmϕg. |
| Open Source Code | No | The paper does not provide any statement or link indicating the availability of open-source code for the described methodology. |
| Open Datasets | No | This is a theoretical paper and does not use or evaluate models on datasets. Therefore, no information about public dataset availability is provided. |
| Dataset Splits | No | This is a theoretical paper and does not involve experimental validation on datasets, thus no dataset split information for training/validation is provided. |
| Hardware Specification | No | This is a theoretical paper and does not report on experiments requiring specific hardware; therefore, no hardware specifications are mentioned. |
| Software Dependencies | No | This is a theoretical paper and does not involve empirical experiments requiring specific software dependencies with version numbers. |
| Experiment Setup | No | This is a theoretical paper and does not include experimental setups, hyperparameters, or training configurations. |