SharpSAT-TD in Model Counting Competitions 2021-2023
Not on the map. Why?
Abstract (arXiv)
We describe SharpSAT-TD, our submission to the unweighted and weighted tracks of the Model Counting Competition in 2021-2023, which has won in total 6 first places in different tracks of the competition. SharpSAT-TD is based on SharpSAT [Thurley, SAT 2006], with the primary novel modification being the use of tree decompositions in the variable selection heuristic as introduced by the authors in [CP 2021]. Unlike the version of SharpSAT-TD evaluated in [CP 2021], the current version that is available in https://github.com/Laakeri/sharpsat-td features also other significant modifications compared to the original SharpSAT, for example, a new preprocessor.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 2 of its 10 references that are in the map. First posted on arXiv 30 Aug 2023.
Builds on
2 of 10 references.
References · 2
- 2017Computing Tree Decompositions with FlowCutter: PACE 2017 Submissioncited by 7
- 2015Graph Bisection with Pareto-Optimizationcited by 4
Built on by
Citing papers per year: 2024: 1; 2025: 2.
3 papers.