ML Anthology

Modelling Satisfiability Problems: Theory and Practice

Valentin Mayer-Eichberger
IJCAI 2016 pp. 4012-4013
/ijcai/2016/mayereichberger2016ijcai-modelling/

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

PDF IJCAI Semantic Scholar

Cite

Text

Mayer-Eichberger. "Modelling Satisfiability Problems: Theory and Practice." International Joint Conference on Artificial Intelligence, 2016.

Markdown

[Mayer-Eichberger. "Modelling Satisfiability Problems: Theory and Practice." International Joint Conference on Artificial Intelligence, 2016.](https://mlanthology.org/ijcai/2016/mayereichberger2016ijcai-modelling/)

BibTeX

@inproceedings{mayereichberger2016ijcai-modelling,
  title     = {{Modelling Satisfiability Problems: Theory and Practice}},
  author    = {Mayer-Eichberger, Valentin},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2016},
  pages     = {4012-4013},
  url       = {https://mlanthology.org/ijcai/2016/mayereichberger2016ijcai-modelling/}
}