Answer Set Solving with Bounded Treewidth Revisited
- 28 June 2017
- book chapter
- Published by Springer Nature
- p. 132-145
Abstract
No abstract availableKeywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Answer Set Solving with Bounded Treewidth Revisited2017
- Backdoors to tractable answer set programmingArtificial Intelligence, 2015
- Parameterized Algorithms2015
- Tractable answer-set programming with weight constraints: bounded treewidth is not enoughTheory and Practice of Logic Programming, 2012
- Answer set programming at a glanceCommunications of the ACM, 2011
- Pushing Efficient Evaluation of HEX Programs by Modular DecompositionLecture Notes in Computer Science, 2011
- Algorithms for propositional model countingJournal of Discrete Algorithms, 2010
- Belief Revision with Bounded Treewidth2009
- Combinatorial Optimization on Graphs of Bounded TreewidthThe Computer Journal, 2007
- sharpSAT – Counting Models with Advanced Component Caching and Implicit BCP2006