LearnSAT: a SAT solver for education

Authors:
Mordechai (Moti) Ben-Ari
Affiliations:
Department of Science Teaching, Weizmann Institute of Science, Rehovot, Israel
Venue:
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Year:
2013

Citing 3
Cited 0

GRASP—a new search algorithm for satisfiability

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Boolean satisfiability from theoretical hardness to practical success

Communications of the ACM - A Blind Person's Interaction with Technology
Mathematical Logic for Computer Science

Mathematical Logic for Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The extensive research on SAT solving and the development of software for applications have not been matched by the development of educational materials for introducing students to this field. LearnSAT is a SAT solver designed for educational purposes. It implements the DPLL algorithm with CDCL and NCB. LearnSAT produces detailed output of the execution of the algorithms. It generates assignment trees and the implication graphs of CDCL which are rendered by dot. LearnSAT is written in Prolog so that the algorithms are concise and easy to read.