ngiambla / boolean_sat_bb

Boolean SAT solver, using Branch and Bound.

ms_util

Boolean SAT solver, using Branch and Bound.

Introduction

To generate the executable required for operation, please navigate to the source directory of this project.

~$ cd source

Make

To generate the executable, open a terminal process, and ensure that the terminal is operating in the source directory of this folder.

Once there, enter the following commands:

~$ make clean
~$ make

Execution Instructions

To execute this project, please ensure that a terminal process is running and is currently in the source directory of this project. Enter this command:

~$ ./ms_util -file [filename] -opt [y|n]

Where:

filename can either be:

1.cnf
2.cnf
3.cnf
4.cnf
t.cnf
t3.cnf
t4.cnf
t8.cnf

And -opt defines if this algorithm is to be run with an optimization on (y) or off (n). The optimization performs a heuristic based measure for solving a specified MAX-SAT problem.

Author

Nicholas V. Giamblanco, 2017

This project was intended for the course ECE1387, at the University of Toronto.