{"type":"ScholarlyArticle","title":"Modelling Satisfiability Problems: Theory and Practice","authors":[{"name":"Valentin Mayer-Eichberger","slug":"valentin-mayer-eichberger","given":"Valentin","family":"Mayer-Eichberger","affiliation":""}],"abstract":"Boolean Satisfiability (SAT) solvers are a mature technology to solve hard combinatorial problems. The input to a SAT solver is the problem translated to propositional logic in conjunctive normal form (CNF). This thesis studies such translations and aims to make SAT solvers more accessible to non-encoding experts.","doi":null,"url":"https://ijcai.org/proceedings/2016/580","pdf":"https://ijcai.org/proceedings/2016/0580.pdf","markdown":"https://ijcai.org/proceedings/2016/580.md","bibtex":"https://ijcai.org/proceedings/2016/bibtex/580","volume":{"slug":"2016","title":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2016","url":"https://ijcai.org/proceedings/2016/","year":2016,"location":"New York, NY, USA","dates":"9–15 July 2016","editors":"Subbarao Kambhampati","isbn":"978-1-57735-770-4; 978-1-57735-771-1","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":580,"pages":{"first":4012,"last":4012},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}