The computational complexity of propositional STRIPS planning (Q1337679): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0004-3702(94)90081-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061146398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning for conjunctive goals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about partially ordered events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impediments to universal preference-based default theories / 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: STRIPS: A new approach to the application of theorem proving to problem solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about action. I: A possible worlds approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Macro-operators: A weak method for learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank

Latest revision as of 09:21, 23 May 2024

scientific article
Language Label Description Also known as
English
The computational complexity of propositional STRIPS planning
scientific article

    Statements

    Identifiers