2016•International Joint Conference on Artificial IntelligenceRequires access

Modelling satisfiability problems theory and practice

Valentin Mayer-Eichberger

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.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Conjunctive normal form, Satisfiability, Boolean satisfiability problem, Maximum satisfiability problem, Computer science, Propositional calculus, DPLL algorithm, Propositional formula