---
title: "Modelling Satisfiability Problems: Theory and Practice"
authors:
  - "Valentin Mayer-Eichberger"
doi: ""
url: "https://ijcai.org/proceedings/2016/580"
pdf: "https://ijcai.org/proceedings/2016/0580.pdf"
venue: "Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence"
year: 2016
pages: "4012-4012"
track: ""
keywords:
---

# Modelling Satisfiability Problems: Theory and Practice

Valentin Mayer-Eichberger

*Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence*, pages 4012-4012.

## 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.