The
SAT problem is one of the most prominent problems of
computer science - both in theory and in practice. Combinatorial
problems of considerable dimensions - as they occur,
e.g., in hard- and software verification, planning,
or configuration - are handled successfully by today's
SAT solvers.
Our work concentrates on developing parallel and distributed
SAT solvers, e.g. for the computational grid, and on
visualizing the internal structure of real-world SAT
problem instances.
|