No Cover Image

Book chapter 566 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...

Full description

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!
first_indexed 2013-11-06T02:30:14Z
last_indexed 2018-02-09T04:27:31Z
id cronfa7
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2015-10-15T10:19:48.5298477</datestamp><bib-version>v2</bib-version><id>7</id><entry>2011-10-01</entry><title>Chapter 7: Fundaments of branching heuristics</title><swanseaauthors><author><sid>2b410f26f9324d6b06c2b98f67362d05</sid><ORCID>0000-0003-3021-0095</ORCID><firstname>Oliver</firstname><surname>Kullmann</surname><name>Oliver Kullmann</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2011-10-01</date><deptcode>SCS</deptcode><abstract>&#x201C;Search trees&#x201D;, &#x201C;branching trees&#x201D;, &#x201C;backtracking trees&#x201D; or &#x201C;enumeration trees&#x201D; 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 &#x201C;branching trees&#x201D; 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.</abstract><type>Book chapter</type><journal>Handbook of Satisfiability</journal><paginationStart>205</paginationStart><paginationEnd>244</paginationEnd><publisher>IOS Press</publisher><placeOfPublication>Amsterdam</placeOfPublication><issnPrint/><issnElectronic/><keywords/><publishedDay>31</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2009</publishedYear><publishedDate>2009-12-31</publishedDate><doi>10.3233/978-1-58603-929-5-205</doi><url>http://ebooks.iospress.nl/publication/4991</url><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2015-10-15T10:19:48.5298477</lastEdited><Created>2011-10-01T00:00:00.0000000</Created><path><level id="1">College of Science</level><level id="2">Computer Science</level></path><authors><author><firstname>Oliver</firstname><surname>Kullmann</surname><orcid>0000-0003-3021-0095</orcid><order>1</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling 2015-10-15T10:19:48.5298477 v2 7 2011-10-01 Chapter 7: Fundaments of branching heuristics 2b410f26f9324d6b06c2b98f67362d05 0000-0003-3021-0095 Oliver Kullmann Oliver Kullmann true false 2011-10-01 SCS “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. Book chapter Handbook of Satisfiability 205 244 IOS Press Amsterdam 31 12 2009 2009-12-31 10.3233/978-1-58603-929-5-205 http://ebooks.iospress.nl/publication/4991 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2015-10-15T10:19:48.5298477 2011-10-01T00:00:00.0000000 College of Science Computer Science Oliver Kullmann 0000-0003-3021-0095 1
title Chapter 7: Fundaments of branching heuristics
spellingShingle Chapter 7: Fundaments of branching heuristics
Oliver, Kullmann
title_short Chapter 7: Fundaments of branching heuristics
title_full Chapter 7: Fundaments of branching heuristics
title_fullStr Chapter 7: Fundaments of branching heuristics
title_full_unstemmed Chapter 7: Fundaments of branching heuristics
title_sort Chapter 7: Fundaments of branching heuristics
author_id_str_mv 2b410f26f9324d6b06c2b98f67362d05
author_id_fullname_str_mv 2b410f26f9324d6b06c2b98f67362d05_***_Oliver, Kullmann
author Oliver, Kullmann
author2 Oliver Kullmann
format Book chapter
container_title Handbook of Satisfiability
container_start_page 205
publishDate 2009
institution Swansea University
doi_str_mv 10.3233/978-1-58603-929-5-205
publisher IOS Press
college_str College of Science
hierarchytype
hierarchy_top_id collegeofscience
hierarchy_top_title College of Science
hierarchy_parent_id collegeofscience
hierarchy_parent_title College of Science
department_str Computer Science{{{_:::_}}}College of Science{{{_:::_}}}Computer Science
url http://ebooks.iospress.nl/publication/4991
document_store_str 0
active_str 0
description “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.
published_date 2009-12-31T03:15:19Z
_version_ 1722351217368104960
score 10.852904