Pages that link to "Item:Q5019599"
From MaRDI portal
The following pages link to Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Q5019599):
Displaying 3 items.
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- A practical account into counting Dung's extensions by dynamic programming (Q2694593) (← links)
- IASCAR: incremental answer set counting by anytime refinement (Q6656460) (← links)
