Modelling Satisfiability Problems: Theory and Practice
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.
Valentin Mayer-Eichberger. 2016. Modelling Satisfiability Problems: Theory and Practice. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16. IJCAI, 4012–4012. https://ijcai.org/proceedings/2016/580
Mayer-Eichberger, V. (2016). Modelling Satisfiability Problems: Theory and Practice. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 (pp. 4012–4012). IJCAI. https://ijcai.org/proceedings/2016/580
@inproceedings{ijcai2016p580,
title = {Modelling Satisfiability Problems: Theory and Practice},
author = {Mayer-Eichberger, Valentin},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {4012--4012},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/580},
}
TY - CPAPER TI - Modelling Satisfiability Problems: Theory and Practice AU - Mayer-Eichberger, Valentin T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 4012 EP - 4012 UR - https://ijcai.org/proceedings/2016/580 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
