{"type":"ScholarlyArticle","title":"Planning with SAT, Admissible Heuristics and A*","authors":[{"name":"Jussi Rintanen","slug":"jussi-rintanen","given":"Jussi","family":"Rintanen","affiliation":""}],"abstract":"We study the relationship between optimal planning algorithms, in the form of (iterative deepening) A* with (forward) state-space search, and the reduction of the problem to SAT. Our results establish a strict dominance relation between the two approaches: any iterative deepening A* search can be efficiently simulated in the SAT framework, assuming that the heuristic has been encoded in the SAT problem, but the opposite is not possible as A* and IDA* searches sometimes take exponentially longer.","doi":"10.5591/978-1-57735-516-8/IJCAI11-336","url":"https://ijcai.org/proceedings/2011/336","pdf":"https://ijcai.org/proceedings/2011/0336.pdf","markdown":"https://ijcai.org/proceedings/2011/336.md","bibtex":"https://ijcai.org/proceedings/2011/bibtex/336","volume":{"slug":"2011","title":"Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2011","url":"https://ijcai.org/proceedings/2011/","year":2011,"location":"Barcelona, Catalonia, Spain","dates":"16–22 July 2011","editors":"Toby Walsh","isbn":"978-1-57735-512-0; 978-1-57735-513-7; 978-1-57735-514-4; 978-1-57735-515-1; 978-1-57735-516-8","publisher":"AAAI Press/International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":336,"pages":{"first":2015,"last":2019},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}