Skip to content

Using a SAT solver to prove correctness of schedules given a list of constraints.

License

Notifications You must be signed in to change notification settings

noahbass/scheduler-sat

Repository files navigation

scheduler-sat

CI Status MIT license

Using a SAT solver to prove correctness of schedules given a list of constraints.

Quick Start

This project includes both Python and BDDs (for a SAT solver).

Python code

Requirements:

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

SAT code

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

Presentation

Slide deck

Python Tests

$ pip3 install -r requirements.txt
$ python3 main.test.py -v
$ python3 validator.test.py -v

Authors

@noahbass and @linkb98

License

MIT

About

Using a SAT solver to prove correctness of schedules given a list of constraints.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published