[loginf] Survey on SAT-related Projects

Theodor Lettmann lettmann at uni-paderborn.de
Fri Feb 21 10:53:04 CET 2003

Apologies for multiple copies!

Survey on SAT-related Projects

The satisfiability problem is one of the most popular
NP-complete problems. It is central in the theory of
computation, a core of computationally intractable
NP-problems. Many questions can be formulated as
SAT related questions due to the universality and
simplicity of propositional logic as representation
language. Therefore, methods to solve the SAT related
problems are fundamental in a lot of applications
in automated reasoning, computer-aided design, scheduling,
integrated circuit design, and other areas.

We are trying to compile information about applications
of satisfiability testing and related methods and about
companies that are interested in such research.
Please help us by filling in the questionnaire found at


If you want to give us some information, but find the
questionnaire cumbersome, then please just email to

             sat at uni-pb.de

We will make the compiled information available for the
community as soon as possible.

Thank you!

Oliver Kullmann
Computer Science Department
University of Wales Swansea
Singleton Park, Faraday Building
Swansea SA2 8PP
United Kingdom

Hans Kleine Büning, Theo Lettmann
Department of Computer Science
University of Paderborn
D-33095 Paderborn

More information about the loginf mailing list