swMATH21112MaRDI QIDQ32924FDOQ32924
Author name not available (Why is that?)
Official website: https://github.com/mabseher/htd/tree/v1.0.0-beta1
Source code repository: https://github.com/mabseher/htd/tree/v1.0.0-beta1
Cited In (26)
- ProCount: weighted projected model counting with graded project-join trees
- Weighted model counting without parameter variables
- GANAK
- Taming high treewidth with abstraction, nested dynamic programming, and database technology
- Solving projected model counting by utilizing treewidth and its limits
- Utilizing treewidth for quantitative reasoning on epistemic logic programs
- dynASP
- sharpSAT
- GRAPPA
- GrappaVis
- Lpopt
- lp2normal
- Jdrasil
- GI-log
- selp
- ASPTools
- Optimizing answer set computation via heuristic-based decomposition
- Linearizing genomes: exact methods and local search
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Hailfinder
- eclingo
- countAntom
- Dsharp
- Title not available (Why is that?)
- A faster tree-decomposition based algorithm for counting linear extensions
- selp: a single-shot epistemic logic program solver
This page was built for software: htd
