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

@@ Property / cites work @@
+Q4012206
@@ Property / cites work: Q4012206 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4012203
@@ Property / cites work: Q4012203 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4012204
@@ Property / cites work: Q4012204 / rank @@
+Normal rank
@@ Property / cites work @@
+Planning for conjunctive goals
@@ Property / cites work: Planning for conjunctive goals / rank @@
+Normal rank
@@ Property / cites work @@
+Q4012216
@@ Property / cites work: Q4012216 / rank @@
+Normal rank
@@ Property / cites work @@
+Reasoning about partially ordered events
@@ Property / cites work: Reasoning about partially ordered events / rank @@
+Normal rank
@@ Property / cites work @@
+Impediments to universal preference-based default theories
+Normal rank
@@ Property / cites work @@
+Complexity, decidability and undecidability results for domain-independent planning
+Normal rank
@@ Property / cites work @@
+STRIPS: A new approach to the application of theorem proving to problem solving
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Reasoning about action. I: A possible worlds approach
+Normal rank
@@ Property / cites work @@
+Macro-operators: A weak method for learning
@@ Property / cites work: Macro-operators: A weak method for learning / rank @@
+Normal rank
@@ Property / cites work @@
+The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary
+Normal rank
@@ Property / cites work @@
+Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
+Normal rank
@@ Property / cites work @@
+Q3856120
@@ Property / cites work: Q3856120 / rank @@
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank