Skip navigation
Skip navigation

Heuristic Planning with SAT: Beyond Uninformed Depth-First Search

Rintanen, Jussi


Planning-specific heuristics for SAT have recently been shown to produce planners that match best earlier ones that use other search methods, including the until now dominant heuristic state-space search. The heuristics are simple and natural, and enforce pure depth-first search with backward chaining in the standard conflict-directed clause learning (CDCL) framework. In this work we consider alternatives to pure depth-first search, and show that carefully chosen randomized search order, which...[Show more]

CollectionsANU Research Publications
Date published: 2010
Type: Conference paper
Source: Proceedings of the Australasian Joint Conference on Artificial Intelligence (AI 2010)
DOI: 10.1007/978-3-642-17432-2_42


File Description SizeFormat Image
01_Rintanen_Heuristic_Planning_with_SAT:_2010.pdf185.51 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator