htd
From MaRDI portal
Software:32924
swMATH21112MaRDI QIDQ32924FDOQ32924
Author name not available (Why is that?)
Source code repository: https://github.com/mabseher/htd/tree/v1.0.0-beta1
Cited In (12)
- Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
- Lpopt: a rule optimization tool for answer set programming
- ProCount: weighted projected model counting with graded project-join trees
- Weighted model counting without parameter variables
- Optimizing Answer Set Computation via Heuristic-Based Decomposition
- Taming high treewidth with abstraction, nested dynamic programming, and database technology
- Solving projected model counting by utilizing treewidth and its limits
- selp: A Single-Shot Epistemic Logic Program Solver
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Title not available (Why is that?)
- A faster tree-decomposition based algorithm for counting linear extensions
- Linearizing Genomes: Exact Methods and Local Search
This page was built for software: htd
