| dc.contributor.author | Voboril, Florentina | |
| dc.contributor.editor | Gesellschaft für Informatik e.V. | |
| dc.date.accessioned | 2023-02-21T09:39:17Z | |
| dc.date.available | 2023-02-21T09:39:17Z | |
| dc.date.issued | 2022 | |
| dc.identifier.isbn | 978-3-88579-752-4 | |
| dc.identifier.issn | 1614-3213 | |
| dc.identifier.uri | http://dl.gi.de/handle/20.500.12116/40231 | |
| dc.description.abstract | In this paper, we revisit a known SAT encoding for the fundamental combinatorial treewidth problem. Based on this encoding, we rework it within the constraint modeling language MiniZinc. Two MiniZinc encodings for treewidth are created and their performance is compared in an experimental evaluation. A further dimension for comparison is added by choosing between different backbone solvers supported by MiniZinc. | en |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik, Bonn | |
| dc.relation.ispartof | SKILL 2022 | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Seminars, Volume S-18 | |
| dc.subject | Treewidth | |
| dc.subject | SAT | |
| dc.subject | Constraint Programming | |
| dc.subject | MiniZinc | |
| dc.title | Computing Treewidth with Constraint Programming | en |
| mci.reference.pages | 115-126 | |
| mci.conference.sessiontitle | Theoretische Informatik | |
| mci.conference.location | Hamburg | |
| mci.conference.date | 29.-30. September 2022 | |
