Journal article 57 views
Chapter 8. Fundaments of Branching Heuristics
Oliver Kullmann 
Frontiers in Artificial Intelligence and Applications, Volume: 336
Swansea University Author:
Oliver Kullmann
Full text not available from this repository: check for access using links below.
DOI (Published version): 10.3233/faia200991
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: | Frontiers in Artificial Intelligence and Applications |
|---|---|
| ISSN: | 0922-6389 1879-8314 |
| Published: |
IOS Press
2021
|
| Online Access: |
Check full text
|
| URI: | https://cronfa.swan.ac.uk/Record/cronfa70993 |
| first_indexed |
2025-11-26T16:01:50Z |
|---|---|
| last_indexed |
2026-01-16T05:32:54Z |
| id |
cronfa70993 |
| recordtype |
SURis |
| fullrecord |
<?xml version="1.0"?><rfc1807><datestamp>2026-01-15T20:16:16.5734830</datestamp><bib-version>v2</bib-version><id>70993</id><entry>2025-11-26</entry><title>Chapter 8. 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>2025-11-26</date><deptcode>MACS</deptcode><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.</abstract><type>Journal Article</type><journal>Frontiers in Artificial Intelligence and Applications</journal><volume>336</volume><journalNumber/><paginationStart/><paginationEnd/><publisher>IOS Press</publisher><placeOfPublication/><isbnPrint/><isbnElectronic/><issnPrint>0922-6389</issnPrint><issnElectronic>1879-8314</issnElectronic><keywords/><publishedDay>31</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2021</publishedYear><publishedDate>2021-12-31</publishedDate><doi>10.3233/faia200991</doi><url/><notes/><college>COLLEGE NANME</college><department>Mathematics and Computer Science School</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>MACS</DepartmentCode><institution>Swansea University</institution><apcterm>Not Required</apcterm><funders/><projectreference/><lastEdited>2026-01-15T20:16:16.5734830</lastEdited><Created>2025-11-26T10:49:16.8852852</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - 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 |
2026-01-15T20:16:16.5734830 v2 70993 2025-11-26 Chapter 8. Fundaments of Branching Heuristics 2b410f26f9324d6b06c2b98f67362d05 0000-0003-3021-0095 Oliver Kullmann Oliver Kullmann true false 2025-11-26 MACS “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. Journal Article Frontiers in Artificial Intelligence and Applications 336 IOS Press 0922-6389 1879-8314 31 12 2021 2021-12-31 10.3233/faia200991 COLLEGE NANME Mathematics and Computer Science School COLLEGE CODE MACS Swansea University Not Required 2026-01-15T20:16:16.5734830 2025-11-26T10:49:16.8852852 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Oliver Kullmann 0000-0003-3021-0095 1 |
| title |
Chapter 8. Fundaments of Branching Heuristics |
| spellingShingle |
Chapter 8. Fundaments of Branching Heuristics Oliver Kullmann |
| title_short |
Chapter 8. Fundaments of Branching Heuristics |
| title_full |
Chapter 8. Fundaments of Branching Heuristics |
| title_fullStr |
Chapter 8. Fundaments of Branching Heuristics |
| title_full_unstemmed |
Chapter 8. Fundaments of Branching Heuristics |
| title_sort |
Chapter 8. Fundaments of Branching Heuristics |
| author_id_str_mv |
2b410f26f9324d6b06c2b98f67362d05 |
| author_id_fullname_str_mv |
2b410f26f9324d6b06c2b98f67362d05_***_Oliver Kullmann |
| author |
Oliver Kullmann |
| author2 |
Oliver Kullmann |
| format |
Journal article |
| container_title |
Frontiers in Artificial Intelligence and Applications |
| container_volume |
336 |
| publishDate |
2021 |
| institution |
Swansea University |
| issn |
0922-6389 1879-8314 |
| doi_str_mv |
10.3233/faia200991 |
| publisher |
IOS Press |
| college_str |
Faculty of Science and Engineering |
| hierarchytype |
|
| hierarchy_top_id |
facultyofscienceandengineering |
| hierarchy_top_title |
Faculty of Science and Engineering |
| hierarchy_parent_id |
facultyofscienceandengineering |
| hierarchy_parent_title |
Faculty of Science and Engineering |
| department_str |
School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science |
| 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 |
2021-12-31T05:34:09Z |
| _version_ |
1856987043968581632 |
| score |
11.096295 |