Treewidth and counting projected answer sets

DOI10.1007/978-3-030-20528-7_9OpenAlexW2924142368MaRDI QIDQ2326718

Markus Hecher, Johannes K. Fichte

Publication date: 10 October 2019

Full work available at URL: https://arxiv.org/abs/1903.11316

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Related Items (2)

Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? ⋮ Solving projected model counting by utilizing treewidth and its limits

This page was built for publication: Treewidth and counting projected answer sets