Fast Counting with Bounded Treewidth

DOI10.1007/978-3-540-89439-1_31zbMath1182.68278OpenAlexW2111738185MaRDI QIDQ5505573

Reinhard Pichler, Stefan Woltran, Michael Jakl, Stefan Rümmele

Publication date: 27 January 2009

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-540-89439-1_31

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)

Related Items (3)

Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ Bounded treewidth as a key to tractability of knowledge representation and reasoning

This page was built for publication: Fast Counting with Bounded Treewidth