Project Proposals

General remarks:

SAT solvers

Projects concerned with the development of complete SAT solvers.

Understanding and enhancing SAT solvers

Resolution complexity

Visualisation

Parallelism

Reductions for SAT

Projects concerned with methods simplifying SAT problems.

Unit-clause propagation and beyond

Autarkies

Branching heuristics

SAT-Representations

How to represent a problem (well) as a SAT problem?

SAT and combinatorics

Ramsey theory

Minimal unsatisfiability

Autarkies

Qualitative matrix analysis

Graph and hypergraph colouring

Matroid theory

Generalised SAT

SAT and CSP

Cryptanalysis and SAT

Mathematical foundations of Satisfiability (SAT)

Categories for SAT

Boolean data analysis

Qualitative comparative analysis (QCA)

Philosophy

Mathematical development of Badiou's approaches

Axiomatic foundations of psychoanalysis

Case studies:


Oliver Kullmann
Last modified: Sat Nov 19 14:05:55 GMT 2011