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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q56083178 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Graphplan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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