Complexity results for standard benchmark domains in planning (Q814425): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fast planning through planning graph analysis / 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, decidability and undecidability results for domain-independent planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of blocks-world planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2717791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocks World revisited / rank
 
Normal rank

Latest revision as of 10:59, 24 June 2024

scientific article
Language Label Description Also known as
English
Complexity results for standard benchmark domains in planning
scientific article

    Statements

    Complexity results for standard benchmark domains in planning (English)
    0 references
    0 references
    7 February 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    Complexity of planning
    0 references
    Planning benchmarks
    0 references
    Planning domains
    0 references
    Transportation problems
    0 references
    0 references