Some Fixed Parameter Tractability Results for Planning with Non-Acyclic Domain-Transition Graphs
Authors: Christer Bäckström
AAAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We prove that planning when the causal graph is a polytree and all DTGs are cycle-DAGs is fpt in parameters c, d, k and pmax. and We will not go further into this since we primarily prove tractability results in this paper. |
| Researcher Affiliation | Academia | Christer B ackstr om Link oping University, SE-58183 Link oping, Sweden. Email: christer.backstrom@liu.se |
| Pseudocode | Yes | Figure 1: Find maximal matching signature. and Figure 2: Signature preprocessing for arbitrary CG. |
| Open Source Code | No | The paper does not provide concrete access to source code for the methodology described. |
| Open Datasets | No | This is a theoretical paper and does not involve datasets or empirical experiments. |
| Dataset Splits | No | This is a theoretical paper and does not involve datasets or empirical experiments, therefore, no training/test/validation splits are discussed. |
| Hardware Specification | No | As this is a theoretical paper with no empirical experiments, no hardware specifications are provided. |
| Software Dependencies | No | The paper is theoretical and describes algorithms conceptually, thus it does not list specific software dependencies with version numbers. |
| Experiment Setup | No | As this is a theoretical paper with no empirical experiments, no experimental setup details or hyperparameters are provided. |