GUPEA >
IT Faculty / IT-fakulteten >
Department of Computer Science and Engineering / Institutionen för data- och informationsteknik >
Doctoral Theses / Doktorsavhandlingar Institutionen för data- och informationsteknik >

Effective SAT solving


Please use this identifier to cite or link to this item: http://hdl.handle.net/2077/18263

Files in This Item:

File Description SizeFormat
gupea_2077_18263_1.pdf927KbAdobe PDF
View/Open
Title: Effective SAT solving
Authors: Sörensson, Niklas
E-mail: nik@cs.chalmers.se
Issue Date: 2-Oct-2008
University: University of Gothenburg. IT-Faculty & Chalmers University of Technology
Institution: Department of Computer Science and Engineering
Date of Defence: 2008-10-17
Disputation: Fredagen den 17 oktober 2008, kl 10.15. Lokal EE, Rännvägen 6, Chalmers University of Technology
Degree: Doctor of Philosophy
Publication type: Doctoral thesis
Series/Report no.: Technical report. D / Department of Computer Science and Engineering, Division of Software Engineering and Technology
45
Abstract: A growing number of problem domains are successfully being tackled by SAT solvers. This thesis contributes to that trend by pushing the state-of-the-art of core SAT algorithms and their implementation, but also in several important application areas. It consists of five papers: the first details the implementation of the SAT solver MiniSat and the other four papers discuss specific issues related to different application domains. In the first paper, catering to the trend of extending and adap... more
ISBN: 978-91-628-7612-8
ISSN: 1653-1787
URI: http://hdl.handle.net/2077/18263
Appears in Collections:Doctoral Theses / Doktorsavhandlingar Institutionen för data- och informationsteknik
Doctoral Theses from University of Gothenburg / Doktorsavhandlingar från Göteborgs universitet

This item has been viewed 450 times.

 

 

© Göteborgs universitet 2011