Skip to content

Latest commit

 

History

History
41 lines (27 loc) · 1.08 KB

README.md

File metadata and controls

41 lines (27 loc) · 1.08 KB

ElimSSAT

The prototype Stochastic Boolean satisfiability solver based on quantifier elimination.

Dependencies

Prerequisite

  • pybind11
    • For building the python binding of Unique for Manthan.
  • Boost Library
    • Require for Unique.

Compile

  • We give a script for installing and compiling dependencies. Use the following command.
./build.sh

Usage

  • The solver is built in the abc system as a command. To execute the solver, use the following command.
./abc -q "ssat" <sdimacs>

Benchmarks

  • We provide three toy cases for testing purpose. You can found them in benchmark folder.

  • The full benchmarks can be found in the repository of ClauSSAT.

Contact

If you have any problems or suggestions, feel free to create an issue or contact us through r09943108@ntu.edu.tw.