Abstract
We suggest some benchmarks based on a propositional encoding of tree decompositions of graphs.
| Original language | English |
|---|---|
| Title of host publication | In Proceedings of SAT Competition 2018: Solver and Benchmark Descriptions, , 2018 |
| Publication date | 2018 |
| Publication status | Published - 2018 |