JKU

TNF / INF

team
contact
software
publications
teaching
jobs


GI-Dissertation Award 2020

FMCAD'20 Student Forum Best Student Contribution

SAT'20 Best Presentation Award

GCAI'19 Post and Interaction Award

IJCAI-JAIR 2019 Award

SAT'19 Best Student Paper

CAV'18 Award

HVC'17 Best Paper

ETAPS'17 Test of Time Award

HVC'15 Award

FMCAD'17 Best Paper

CADE'17 Best Paper

BMC

Handbook of Satisfiability

UML@Classroom

UML@Classroom

www.digitaltechnik.org

[  news | download | background ]

Cleaneling

News

New version version 00v for ReRiSE'14.

New cleaned-up version 00g (see NEWS).

New release version 00f as presented at the VTSA Summer School 2012.

Initial release version 00a as presented at the SAT/SMT Summer School 2012.

Download

[ cleaneling00v.zip |  cleaneling00g.zip |  cleaneling00f.zip |  cleaneling00a.zip ]

In the README you find the list of files of the source distribution, while NEWS describes the latests changes.

We use an MIT license scheme. See LICENSE for more details.

Background

These are the sources of the SAT solver Cleaneling. It is an attempt to produce a clean version of Lingeling, where 'clean' means easy to read, understand and adapt. It does not strive for the same goal as Lingeling to be as efficient as possible, particularly with respect to memory usage.

This is related to our talk given at the SAT / SMT Summer School 2012 in Trento, Italy, which actually gave the motivation for constructing this SAT solver.