Pith. sign in

REVIEW 2 cited by

Planning Domain Model Acquisition from State Traces without Action Parameters

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.10726 v4 pith:ZMFR2NCQ submitted 2024-02-16 cs.AI

classification cs.AI
keywords stateactiontracesparameterschangesactionsdomainmodel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Existing planning action domain model acquisition approaches consider different types of state traces from which they learn. The differences in state traces refer to the level of observability of state changes (from full to none) and whether the observations have some noise (the state changes might be inaccurately logged). However, to the best of our knowledge, all the existing approaches consider state traces in which each state change corresponds to an action specified by its name and all its parameters (all objects that are relevant to the action). Furthermore, the names and types of all the parameters of the actions to be learned are given. These assumptions are too strong. In this paper, we propose a method that learns action schema from state traces with fully observable state changes but without the parameters of actions responsible for the state changes (only action names are part of the state traces). Although we can easily deduce the number (and names) of the actions that will be in the learned domain model, we still need to deduce the number and types of the parameters of each action alongside its precondition and effects. We show that this task is at least as hard as graph isomorphism. However, our experimental evaluation on a large collection of IPC benchmarks shows that our approach is still practical as the number of required parameters is usually small. Compared to the state-of-the-art learning tools SAM and Extended SAM our new algorithm is able to provide better results in multiple domains in terms of learning action models more similar to reference models, even though it uses less information and has fewer restrictions on the input traces.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning Lifted STRIPS Models from Action Traces Alone: A Simple, General, and Scalable Solution

    cs.AI 2024-11 conditional novelty 8.0 of 10

    SIFT learns lifted STRIPS action models (predicates and action schemas) from action traces alone, with formal guarantees and scalability to state graphs of about 500,000 edges.

  2. Learning Lifted Action Models From Traces of Incomplete Actions and States

    cs.AI 2025-08 conditional novelty 6.0 of 10

    SYNTH learns STRIPS+ action models with implicit action arguments and unobserved predicates from incomplete state-action traces, with conditional completeness guarantees and 100 percent verification in experiments.

Pith tools