Pages that link to "Item:Q2661361"
From MaRDI portal
The following pages link to Taming high treewidth with abstraction, nested dynamic programming, and database technology (Q2661361):
Displaying 7 items.
- ProCount: weighted projected model counting with graded project-join trees (Q2118296) (← 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)
- A practical account into counting Dung's extensions by dynamic programming (Q2694593) (← links)
- Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Q5019599) (← links)
- Default logic and bounded treewidth (Q5918613) (← links)
- Exploiting Database Management Systems and Treewidth for Counting (Q6063876) (← links)
