PV4 plingelingproduces a satisfiability result for a formula

Parallel front-end of Lingeling SAT solver

Application domain/field

Type of tool

SAT solver

Expected input

SAT problem

Format:

DIMACS

Expected output

SATISFIABLE, UNSATISFIABLE or UNKNOWN indicating whether the SAT problem is satisfiable, unsatisfiable or it could not be determined.

Comments

License: MIT license
SAT

Links

Last commit date

19 August 2021 (of complete repository)

Related papers

Last publication date

2020

Related tools

Lingeling, Treengeling

ProVerB specific

View/edit source (Markdown)



ProVerB is a part of SLEBoK. Last updated: July 2022.