Skip to content

GitLab

Why GitLab
Pricing
Contact Sales
Explore

Sign in
Get free trial

passat

Project information

A boolean constraint (cnf), satisfyability solver. This one by design generates very short unsat proofs.

SAT solver cnf Pascal

+ 1 more

8 Commits
2 Branches
0 Tags

README

Created on

June 29, 2022

Loading