SAT Encodings of Finite CSPs
Boolean satisfiability (SAT) is the problem of determining whether there exists an assignment of the Boolean variables to the truth values such that a given Boolean formula evaluates to true. SAT was the first example of an NP-complete problem. Only two decades ago SAT was mainly considered as of a...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden
2015
|
| Subjects: | |
| Online Access: | http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-162186 http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-162186 http://www.qucosa.de/fileadmin/data/qucosa/documents/16218/Thesis_Hau_slub.pdf |