Clique-Width and Directed Width Measures for Answer-Set Programming

DOI10.3233/978-1-61499-672-9-1105zbMath1403.68029arXiv1606.09449OpenAlexW2962927332MaRDI QIDQ4576239

Sebastian Ordyniak, Stefan Woltran, Bernhard Bliem

Publication date: 12 July 2018

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Logic programming (68N17)

Related Items (4)

Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? ⋮ Unnamed Item ⋮ A multiparametric view on answer set programming ⋮ Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs

This page was built for publication: Clique-Width and Directed Width Measures for Answer-Set Programming