Skip to content
forked from niklasso/minisat

A minimalistic and high-performance SAT solver

License

Notifications You must be signed in to change notification settings

jia-kai/minisatcs

This branch is 28 commits ahead of, 68 commits behind niklasso/minisat:master.

Folders and files

NameName
Last commit message
Last commit date

Latest commit

df6612d · Jun 30, 2022
Jul 10, 2010
Jun 30, 2022
Feb 13, 2020
Jan 16, 2020
Jan 16, 2020
Nov 30, 2021
Feb 28, 2010
Apr 10, 2010
Feb 18, 2021
Jun 30, 2022

Repository files navigation

MiniSatCS: SAT Solving With Reified Cardinality Constraints

The source code is forked off MiniSat 2.2, with some resources (CMakeLists, test cases) from the Production-ready MiniSAT.

Building

mkdir build
cd build
cmake .. -DCMAKE_BUILD_TYPE=RelWithDebInfo
make -j$(nproc)

Run make test to run the test cases.

Citation

If this project is helpful to your research, please cite our paper:

@inproceedings{jia2020efficient,
 author = {Jia, Kai and Rinard, Martin},
 booktitle = {Advances in Neural Information Processing Systems},
 editor = {H. Larochelle and M. Ranzato and R. Hadsell and M. F. Balcan and H. Lin},
 pages = {1782--1795},
 publisher = {Curran Associates, Inc.},
 title = {Efficient Exact Verification of Binarized Neural Networks},
 url = {https://proceedings.neurips.cc/paper/2020/file/1385974ed5904a438616ff7bdb3f7439-Paper.pdf},
 volume = {33},
 year = {2020}
}

About

A minimalistic and high-performance SAT solver

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Languages

  • C++ 94.0%
  • CMake 3.9%
  • Python 1.4%
  • C 0.7%