| Autor: |
Mikolas, Janota, Radu, Grigore, Vasco, Manquinho |
| Jazyk: |
angličtina |
| Předmět: |
|
| Zdroj: |
24th RCRA International Workshop on "Experimental Evaluation of Algorithms for solving problems with combinatorial explosion" |
| Popis: |
The paper aims at finding acyclic graphs under a given set of\ud constraints. More specifically, given a propositional formula\ud ? over edges of a fixed-size graph, the objective is to find a model of\ud ? that corresponds to a graph that is acyclic. The paper proposes several encodings of the\ud problem and compares them in an experimental evaluation using stateof-the-art\ud SAT solvers. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
