![]() | ![]() |
| 2009 | ||
|---|---|---|
| 2 | Michael Jakl, Reinhard Pichler, Stefan Woltran: Answer-Set Programming with Bounded Treewidth. IJCAI 2009: 816-822 | |
| 2008 | ||
| 1 | Michael Jakl, Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Fast Counting with Bounded Treewidth. LPAR 2008: 436-450 | |
| 1 | Reinhard Pichler | [1] [2] |
| 2 | Stefan Rümmele | [1] |
| 3 | Stefan Woltran | [1] [2] |
Data released under the ODC-BY 1.0 license — See also our legal information page