The Goal after Tomorrow: Offline Goal Reasoning with Norms

Authors: Pere Pardo, Christian Strasser

JAIR 2024 | Venue PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical Our main results include a characterization and comparison of the completeness classes for a variety of offline GR planners, and a discussion of the irreducibility of offline GR to pure planning methods.
Researcher Affiliation Academia Pere Pardo EMAIL University of Luxembourg Department of Computer Science L-4364 Esch-sur-Alzette, Luxembourg; Christian Straßer EMAIL Ruhr-Universit at Bochum Philosophie II D-44780 Bochum, Germany
Pseudocode Yes Algorithm 1 Classical % a depth first search forward planner; Algorithm 2 Choice % a non-deterministic choice; Algorithm 3 ψ-Planner lfp(ψ(P)); Algorithm 4 βClassical; Algorithm 5 Universal; Algorithm 6 Uni Class; Algorithm 7 Append; Algorithm 7b Test expanded(s); Algorithm 8 Replan; Algorithm 9 βSaturate
Open Source Code No The paper does not provide any explicit statements about code release or links to a code repository.
Open Datasets No The paper uses conceptual examples and scenarios like the 'party scenario', 'Akrasia', 'Möbius Strip', 'Omelette', 'Chisholm paradox', and 'Order puzzle' to illustrate theoretical concepts, not empirical datasets for evaluation.
Dataset Splits No The paper does not use any empirical datasets; therefore, no dataset splits are provided.
Hardware Specification No The paper focuses on theoretical analysis of algorithms and does not describe any experiments run on specific hardware.
Software Dependencies No The paper discusses theoretical concepts, logics, and planning formalisms, but does not specify any software dependencies with version numbers for an implementation.
Experiment Setup No The paper focuses on theoretical analysis and conceptual examples, thus no experimental setup details, hyperparameters, or training configurations are provided.