Using a SAT solver to prove correctness of schedules given a list of constraints.
This project includes both Python and BDDs (for a SAT solver).
Requirements:
- Python 3 (and pip 3)
- virtualenv (optional)
Clone and run tests:
$ git clone git@github.com:noahbass/scheduler-sat.git
$ cd scheduler-sat
$ pip3 install -r requirements.txt # optionally use virtualenv before this step
$ python3 main.test.py -v
Requirements:
Clone and run:
$ git clone git@github.com:noahbass/scheduler-sat.git
$ cd scheduler-sat
$ sbsat validator.bdd # or use ./sbsat.run validator.bdd
# Reading File validator.bdd ....
# Reading ITE ... Done
# Preprocessing .... Done
# Satisfiable
# Total Time: 0.005
$ pip3 install -r requirements.txt
$ python3 main.test.py -v
$ python3 validator.test.py -v