Revision as of 00:28, 25 January 2024 edit Obankston (talk \| contribs) Extended confirmed users 4,807 edits add link, fix error in citation ← Previous edit		Revision as of 11:27, 25 April 2024 edit undo 157.193.240.159 (talk) No edit summary Next edit →
Line 83: === Reduction to other problems === * reduction to the [[propositional satisfiability]] problem ([[satplan]]). * reduction to [[~~Model~~model checking]] - both are essentially problems of traversing state spaces, and the classical planning problem corresponds to a subclass of model checking problems. ===Temporal planning===

Automated planning and scheduling: Difference between revisions