Counting and Enumeration Problems with Bounded Treewidth

DOI10.1007/978-3-642-17511-4_22zbMath1310.68118OpenAlexW1891223022MaRDI QIDQ3066110

Stefan Woltran, Reinhard Pichler, Stefan Rümmele

Publication date: 7 January 2011

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17511-4_22

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Model theory of finite structures (03C13) Logic programming (68N17)

Related Items (4)

Solving projected model counting by utilizing treewidth and its limits ⋮ Unnamed Item ⋮ Default logic and bounded treewidth ⋮ Structural tractability of enumerating CSP solutions

This page was built for publication: Counting and Enumeration Problems with Bounded Treewidth