- this is a python implementation of the most known sat-solving approaches
- there is also a server-client app to make the satsolver-benchmarking as easy as possible
- as 2 little side-projects the app contains sat-reductions of sudoku and n-queens problems, easily runnable with the frontend, with nice visualizations
-
0: (Only if you had had any of previous versions installed) Rebuild:
docker compose build --no-cache --pull
-
1: Start containers:
docker compose up -d --force-recreate --build
- the frontend runs at
http://localhost:5000
- log levels:
DEBUG
: everything;INFO
: transformation of the formula to cnf, model of the formula, sat/unsat;WARNING
: only sat/unsat
- the frontend runs at
-
2: Stop containers:
docker compose stop
- this project was developped as a part of exam for course NAIL094 - Decision Procedures and Verification at Charles University in Prague
- the implementation consisted of fulfilling a set of tasks
- Task 1: Tseitin Encoding and DIMACS format
- Task 2: DPLL
- Task 3: Watched Literals
- Task 4: CDCL
- Task 5: Decision Heuristics
- Task 6: N-Queens
- Task 7: Sudoku
- interesting web pages with information that helped me with developing the sat-solver and the server-client architecture
- information about development-setup, release creation, and other information which is helpful if you want to help with development of the app