Immediate Massively Parallel Propositional Proof Checking
-
Updated
Jul 12, 2024 - C
Immediate Massively Parallel Propositional Proof Checking
Lingeling SAT Solver fork with CMake build
Bounded model checker for petri nets. It uses a SAT solver. The idea is presented at ATVA 2004.
Add a description, image, and links to the sat-solving topic page so that developers can more easily learn about it.
To associate your repository with the sat-solving topic, visit your repo's landing page and select "manage topics."