{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article5390","name":"Methods for Solving Extremal Problems in Practice","abstract":"During the 20 th century there has been an incredible progress in solving theoretically hard problems in practice. One of the most prominent examples is the DPLL algorithm and its derivatives to solve the Boolean satisfiability problem, which can handle instances with millions of variables and clauses in reasonable time, notwithstanding the theoretical difficulty of solving the problem.\r\n\r\nDespite this progress, there are classes of problems that contain especially hard instances, which have remained open for decades despite their relative small size. One such class is the class of extremal problems, which typically involve finding a combinatorial object under some constraints (e.g, the search for Ramsey numbers). In recent years, a number of specialized methods have emerged to tackle extremal problems. Most of these methods are applied to a specific problem, despite the fact there is a great deal in common between different problems.\r\n\r\nFollowing a meticulous examination of these methods, we would like to extend them to handle general extremal problems. Further more, we would like to offer ways to exploit the general structure of extremal problems in order to develop constraints and symmetry breaking techniques which will, hopefully, improve existing tools. The latter point is of immense importance in the context of extremal problems, which often hamper existing tools when there is a great deal of symmetry in the search space, or when not enough is known of the problem structure. For example, if a graph is a solution to a problem instance, in many cases any isomorphic graph will also be a solution. In such cases, existing methods can usually be applied only if the model excludes symmetries.","keywords":["Extremal Problems","Constraints","SAT Solving","Logic Programming","Parallelism"],"author":{"@type":"Person","name":"Frank, Michael","givenName":"Michael","familyName":"Frank"},"position":21,"pageStart":"21:1","pageEnd":"21:6","dateCreated":"2016-11-11","datePublished":"2016-11-11","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":{"@type":"Person","name":"Frank, Michael","givenName":"Michael","familyName":"Frank"},"copyrightYear":"2016","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/OASIcs.ICLP.2016.21","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/dx.doi.org\/10.1007\/978-3-319-04921-2_19","http:\/\/arxiv.org\/abs\/1508.05737","http:\/\/dx.doi.org\/10.1016\/j.jcss.2005.06.002","http:\/\/arxiv.org\/abs\/1510.08266","http:\/\/www.aaai.org\/ocs\/index.php\/IJCAI\/IJCAI13\/paper\/view\/6480","http:\/\/minisat.se\/Main.html","http:\/\/arxiv.org\/abs\/1410.2736","http:\/\/arxiv.org\/abs\/1501.06946","https:\/\/www.cs.bgu.ac.il\/~frankm\/plnauty\/","http:\/\/arxiv.org\/abs\/1212.1328","http:\/\/arxiv.org\/abs\/1511.08205","http:\/\/dx.doi.org\/10.1002\/jgt.3190190304","http:\/\/dx.doi.org\/10.1613\/jair.3809","http:\/\/www.combinatorics.org\/","http:\/\/www.msoos.org\/cryptominisat2"],"isPartOf":{"@type":"PublicationVolume","@id":"#volume4504","volumeNumber":52,"name":"Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)","dateCreated":"2016-11-11","datePublished":"2016-11-11","editor":[{"@type":"Person","name":"Carro, Manuel","givenName":"Manuel","familyName":"Carro"},{"@type":"Person","name":"King, Andy","givenName":"Andy","familyName":"King"},{"@type":"Person","name":"Saeedloei, Neda","givenName":"Neda","familyName":"Saeedloei"},{"@type":"Person","name":"De Vos, Marina","givenName":"Marina","familyName":"De Vos"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article5390","isPartOf":{"@type":"Periodical","@id":"#series115","name":"Open Access Series in Informatics","issn":"2190-6807","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume4504"}}}