The following publications are possibly variants of this publication:
- Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not EnoughReinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran. kr 2010: [doi]
- Tractable answer-set programming with weight constraints: bounded treewidth is not enoughReinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran. tplp, 14(2):141-164, 2014. [doi]
- Complexity results for answer set programming with bounded predicate arities and implicationsThomas Eiter, Wolfgang Faber, Michael Fink, Stefan Woltran. AMAI, 51(2-4):123-165, 2007. [doi]
- Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set ProgrammingThomas Eiter, Wolfgang Faber, Michael Fink, Gerald Pfeifer, Stefan Woltran. asp 2003: [doi]
- Answer Set Solving with Bounded Treewidth RevisitedJohannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran. lpnmr 2017: 132-145 [doi]
- The Impact of Treewidth on Grounding and Solving of Answer Set ProgramsBernhard Bliem, Michael Morak, Marius Moldovan, Stefan Woltran. jair, 67:35-80, 2020. [doi]