Tesis doctoral de Ignasi Abío Roig
The topic of this thesis is the development of sat-based techniques and tools for solving industrial combinatorial problems. First, it describes the architecture of state-of-the-art sat and smt solvers based on the classical dpll procedure. These systems can be used as black boxes for solving combinatorial problems. However, sometimes we can increase their efficiency with slight modifications of the basic algorithm. Therefore, the study and development of techniques for adjusting sat solvers to specific combinatorial problems is the first goal of this thesis. namely, sat solvers can only deal with propositional logic. For solving general combinatorial problems, two different approaches are possible: – reducing the complex constraints into propositional clauses. – enriching the sat solver language. the first approach corresponds to encoding the constraint into sat. The second one corresponds to using propagators, the basis for smt solvers. Regarding the first approach, in this document we improve the encoding of two of the most important combinatorial constraints: cardinality constraints and pseudo-boolean constraints. After that, we present a new mixed approach, called lazy decomposition, which combines the advantages of encodings and propagators. the other part of the thesis uses these theoretical improvements in industrial combinatorial problems. We give a method for efficiently scheduling some professional sport leagues with sat. The results are promising and show that a sat approach is valid for these problems. however, the chaotical behavior of cdcl-based sat solvers due to vsids heuristics makes it difficult to obtain a similar solution for two similar problems. This may be inconvenient in real-world problems, since a user expects similar solutions when it makes slight modifications to the problem specification. In order to overcome this limitation, we have studied and solved the close solution problem, i.E., The problem of quickly finding a close solution when a similar problem is considered.
Datos académicos de la tesis doctoral «Solving hard industrial combinatorial problems with sat«
- Título de la tesis: Solving hard industrial combinatorial problems with sat
- Autor: Ignasi Abío Roig
- Universidad: Politécnica de catalunya
- Fecha de lectura de la tesis: 15/05/2013
Dirección y tribunal
- Director de la tesis
- Robert Lukas Mario Nieuwenhuis
- Tribunal
- Presidente del tribunal: albert Rubio gimeno
- joao Marques silva (vocal)
- iníªs Lynce (vocal)
- Carlos José Ansótegui gil (vocal)