Concise finite-domain representations for PDDL planning tasks (Q835819): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning as heuristic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of propositional STRIPS planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Classifications of Boolean Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity, decidability and undecidability results for domain-independent planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2717791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-variable planning under structural restrictions: algorithms and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LP-Based Heuristic for Optimal Planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624116 / rank
 
Normal rank

Revision as of 21:58, 1 July 2024

scientific article
Language Label Description Also known as
English
Concise finite-domain representations for PDDL planning tasks
scientific article

    Statements

    Concise finite-domain representations for PDDL planning tasks (English)
    0 references
    0 references
    31 August 2009
    0 references
    automated planning
    0 references
    problem reformulation
    0 references
    PDDL
    0 references
    SAS\(^{+}\)
    0 references
    0 references
    0 references

    Identifiers