log-k-decomp implements a novel parallel algorithm to compute Hypertree Decompositions based on the structural information of CQs or CSPs. This can then be used to evaluate them in provably polynomial time.
Needs Go 1.14 to be installed first. Files to install it for Linux, macOS or Windows can be found here: https://go.dev/dl/.
Command to produce exectuable: go build
Run ./log-k-decomp -h to see currently supported command and options. Hypergraphs need to be encoded in HyperBench format, more info here: http://hyperbench.dbai.tuwien.ac.at/downloads/manual.pdf
[1] G. Gottlob, M. Lanzinger, C. Okulmus, R. Pichler: Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. accepted for PODS'22.