equal
deleted
inserted
replaced
41 <p><B>Description:</b> |
41 <p><B>Description:</b> |
42 SAT-solver search for satisfying assignments of boolean formulas. Although this |
42 SAT-solver search for satisfying assignments of boolean formulas. Although this |
43 is a computationally hard problem (<A HREF="http://en.wikipedia.org/wiki/NP-complete">NP-complete</A>), |
43 is a computationally hard problem (<A HREF="http://en.wikipedia.org/wiki/NP-complete">NP-complete</A>), |
44 modern SAT-solvers routinely solve boolean formulas with 100,000 and more variables. |
44 modern SAT-solvers routinely solve boolean formulas with 100,000 and more variables. |
45 Application areas of SAT-solver are manifold: they range from hardware verification to |
45 Application areas of SAT-solver are manifold: they range from hardware verification to |
46 Sudoku solvers. Every 2 years there is a competition of the best SAT-solvers in the world.</p> |
46 Sudoku solvers (see <a href="http://anytime.cs.umass.edu/aimath06/proceedings/P34.pdf">here</a>) |
|
47 Every 2 years there is a competition of the best SAT-solvers in the world.</p> |
47 |
48 |
48 <p> |
49 <p> |
49 Most SAT-solvers are written in C. The aim of this project is to design and implement |
50 Most SAT-solvers are written in C. The aim of this project is to design and implement |
50 a SAT-solver in a functional programming language (preferably |
51 a SAT-solver in a functional programming language (preferably |
51 <A HREF="http://en.wikipedia.org/wiki/Standard_ML">ML</A>, but |
52 <A HREF="http://en.wikipedia.org/wiki/Standard_ML">ML</A>, but |