The computational complexity of avoiding spurious states in state space abstraction (Q622104): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5594195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Downward refinement and the efficiency of hierarchical problem solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning as heuristic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: STRIPS: A new approach to the application of theorem proving to problem solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatically generating abstractions for planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using regression-match graphs to control search in planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Recent Results in Heuristic Search Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expected length of a shortest path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning in a hierarchy of abstraction spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4935136 / rank
 
Normal rank

Latest revision as of 17:48, 3 July 2024

scientific article
Language Label Description Also known as
English
The computational complexity of avoiding spurious states in state space abstraction
scientific article

    Statements