An Extensible SAT-solver
Paper i proceeding, 2003

In this article, we present a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified by Chaff. We aim to give sufficient details about implementation to enable the reader to construct his or her own solver in a very short time.This will allow users of SAT-solvers to make domain specific extensions or adaptions of current state-of-the-art SAT-techniques, to meet the needs of a particular application area. The presented solver is designed with this in mind, and includes among other things a mechanism for adding arbitrary boolean constraints. It also supports solving a series of related SAT-problems efficiently by an incremental SAT-interface.

Författare

Niklas Sörensson

Göteborgs universitet

Niklas Een

Chalmers, Institutionen för datavetenskap

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 2919 502-518

Ämneskategorier

Datavetenskap (datalogi)

DOI

10.1007/978-3-540-24605-3_37

ISBN

3-540-20851-8

Mer information

Skapat

2017-10-07