The following pages link to htd (Q32924):
Displaying 12 items.
- A faster tree-decomposition based algorithm for counting linear extensions (Q786030) (← links)
- Weighted model counting without parameter variables (Q2118293) (← links)
- ProCount: weighted projected model counting with graded project-join trees (Q2118296) (← links)
- Lpopt: a rule optimization tool for answer set programming (Q2409731) (← links)
- Taming high treewidth with abstraction, nested dynamic programming, and database technology (Q2661361) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- Solving projected model counting by utilizing treewidth and its limits (Q2680775) (← links)
- Linearizing Genomes: Exact Methods and Local Search (Q3297780) (← links)
- Optimizing Answer Set Computation via Heuristic-Based Decomposition (Q4957190) (← links)
- selp: <i>A Single-Shot Epistemic Logic Program Solver</i> (Q4957201) (← links)
- (Q5009587) (← links)
- Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Q5019599) (← links)
