The computational complexity of propositional STRIPS planning
type: Item
instance of: scholarly article
title: The computational complexity of propositional STRIPS planning
zbMATH Open document ID: 0821.68065
DOI: 10.1016/0004-3702(94)90081-7
author: Tom Bylander
published in: Artificial Intelligence
publication date: 1995-09-19T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 683692
zbMATH Keywords: computational complexity
zbMATH Keywords: STRIPS planning
MaRDI profile type: Publication
full work available at URL: 0004-3702(94)90081-7
OpenAlex ID: W2061146398
cites work: Q4012206
cites work: Q4012203
cites work: Q4012204
cites work: Planning for conjunctive goals
cites work: Q4012216
cites work: Reasoning about partially ordered events
cites work: Impediments to universal preference-based default theories
cites work: Complexity, decidability and undecidability results for domain-independent planning
cites work: STRIPS: A new approach to the application of theorem proving to problem solving
cites work: Q4198056
cites work: Reasoning about action. I: A possible worlds approach
cites work: Macro-operators: A weak method for learning
cites work: The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary
cites work: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
cites work: Q3856120
cites work: Relationships between nondeterministic and deterministic tape complexities
description: scientific article; zbMATH DE number 683692