Book chapter 1188 views
Chapter 7: Fundaments of branching heuristics
Oliver Kullmann 
Handbook of Satisfiability, Pages: 205 - 244
Swansea University Author:
Oliver Kullmann
Full text not available from this repository: check for access using links below.
DOI (Published version): 10.3233/978-1-58603-929-5-205
Abstract
“Search trees”, “branching trees”, “backtracking trees” or “enumeration trees” are at the heart of many (complete) approaches towards hard combinatorial problems, constraint problems, and, of course, SAT problems. Given many choices for branching, the fundamental question is how to guide the choices...
| Published in: | Handbook of Satisfiability |
|---|---|
| Published: |
Amsterdam
IOS Press
2009
|
| Online Access: |
http://ebooks.iospress.nl/publication/4991 |
| URI: | https://cronfa.swan.ac.uk/Record/cronfa7 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract: |
“Search trees”, “branching trees”, “backtracking trees” or “enumeration trees” are at the heart of many (complete) approaches towards hard combinatorial problems, constraint problems, and, of course, SAT problems. Given many choices for branching, the fundamental question is how to guide the choices so that the resulting trees are (relatively) small. Despite (or perhaps because) of its apparently more narrow scope, especially in the SAT area several approaches from theory and applications have found together, and the rudiments of a theory of branching heuristics emerged. In this chapter the first systematic treatment is given.So a general theory of heuristics guiding the construction of “branching trees” is developed, ranging from a general theoretical analysis to the analysis of the historical development of branching heuristics for SAT solvers, and also to heuristics beyond SAT solving. |
|---|---|
| College: |
Faculty of Science and Engineering |
| Start Page: |
205 |
| End Page: |
244 |