Algorithms and Complexity Group
  • People
  • Research
  • Courses
  • Talks
  • Jobs
  • Contact

FraSMT - A tool for computing the fractional hypertree width of hypergraphs

Bounded fractional hypertree width (fhtw) is the most general known structural property that guarantees polynomial-time solvability of the constraint satisfaction problem. Bounded fhtw generalizes other structural properties like bounded induced width and bounded hypertree width.

FraSMT is the first practical algorithm for computing the fhtw and its associated structural decomposition. FraSMT is based on an efficient encoding of the decomposition problem to SMT (SAT modulo Theory) with Linear Arithmetic as implemented in the SMT solver Z3. The encoding is further strengthened by preprocessing and symmetry breaking methods.

Downloads

The fraSMT tool can be downloaded from this GitHub page.

Benchmark instances can be downloaded from this Zendodo.org page.

Team

Markus Hecher, Johannes Fichte, Neha Lodha, Stefan Szeider

Publications

1 result
2018
[1]An SMT Approach to Fractional Hypertree Width
Johannes K. Fichte, Markus Hecher, Neha Lodha, Stefan Szeider
Proceedings of CP 2018, the 24rd International Conference on Principles and Practice of Constraint Programming (John N. Hooker, ed.), volume 11008 of Lecture Notes in Computer Science, pages 109–127, 2018, Springer Verlag.
[bibtex] [pdf] [doi]

News

  • Best paper award at EvoCOP 2022

    Best paper award at EvoCOP 2022

    2022-05-24
    Jonas Mayerhofer, Markus Kirchweger, Marc Huber, and Günther Raidl received the best paper award for their work A Beam Search …Read More »
  • New PhD: Guangping Li

    New PhD: Guangping Li

    2022-05-13
    Guangping Li successfully defended her PhD thesis “An Algorithmic Study of Practical Map Labeling” on May 13, 2022. Congratulations, Dr. …Read More »
  • Outstanding results for TU Wien students at the 2021 Graph Drawing Contest

    Outstanding results for TU Wien students at the 2021 Graph Drawing Contest

    2021-09-24
    The 28th Annual Graph Drawing Contest, a long running tradition of the graph drawing research community, was held in conjunction …Read More »
  • Jan Dreier receives a LICS’21 Distinguished Paper Award

    Jan Dreier receives a LICS’21 Distinguished Paper Award

    2021-07-02
    Congratulations to Jan Dreier for his LICS 2021 Distinguished Paper Award for his paper Lacon- and Shrub-Decompositions: A New Characterization …Read More »
  • Lecture at Austrian Parliament

    Lecture at Austrian Parliament

    2021-06-16
    Stefan Szeider and Martin Kronegger gave a lecture on Algorithms and Programming to members of the Austrian Parliament. The lecture …Read More »

News archive

All news for 2015, 2016, 2017, 2018, 2019, 2020 and 2021.
TU Wien Informatics
Offenlegung (§25 MedienG) Inhaber der Website ist das Institut für Logic and Computation an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. – Disclaimer – Datenschutzerklärung
Log in requires cookies.