| | Preview | Author(s) | Title | Type | Issue Date |
| 1 | | Abseher, Michael ; Bliem, Bernhard ; Charwat, Günther ; Dusberger, Frederico ; Woltran, Stefan | Computing Secure Sets in Graphs using Answer Set Programming | Artikel Article | Jun-2020 |
| 2 | | Bliem, Bernhard ; Woltran, Stefan | Defensive alliances in graphs of bounded treewidth | Artikel Article | 31-Dec-2018 |
| 3 | | Bliem, Bernhard ; Woltran, Stefan | Complexity of Secure Sets | Artikel Article | 2018 |
| 4 | | Bliem, Bernhard ; Woltran, Stefan | Equivalence between answer-set programs under (partially) fixed input | Artikel Article | 2018 |
| 5 | | Abseher, Michael ; Hecher, Markus ; Moldovan, Marius ; Woltran, Stefan ; Bliem, Bernhard | Dynamic Programming on Tree Decompositions with {D-FLAT} | Artikel Article | 2018 |
| 6 | | Morak, Michael ; Bichler, Manuel ; Woltran, Stefan | lpopt: A Rule Optimization Tool for Answer Set Programming | Konferenzbeitrag Inproceedings | 2017 |
| 7 | | Bliem, Bernhard ; Moldovan, Marius ; Morak, Michael ; Woltran, Stefan | The Impact of Treewidth on ASP Grounding and Solving | Konferenzbeitrag Inproceedings | 2017 |
| 8 | | Abseher, Michael ; Musliu, Nysret ; Woltran, Stefan | htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond | Konferenzbeitrag Inproceedings | 2017 |
| 9 | | Bliem, Bernhard ; Pichler, Reinhard ; Woltran, Stefan | Implementing Courcelle's Theorem in a declarative framework for dynamic programming | Artikel Article | 2017 |
| 10 | | Abseher, Michael ; Musliu, Nysret ; Woltran, Stefan | Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning | Artikel Article | 2017 |
| 11 | | Bliem, Bernhard ; Woltran, Stefan | Equivalence Between Answer-Set Programs Under (Partially) Fixed Input | Konferenzbeitrag Inproceedings | 2016 |
| 12 | | Bliem, Bernhard ; Kaufmann, Benjamin ; Schaub, Torsten ; Woltran, Stefan | ASP for Anytime Dynamic Programming on Tree Decompositions | Konferenzbeitrag Inproceedings | 2016 |
| 13 | | Bliem, Bernhard ; Hecher, Markus ; Woltran, Stefan | On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions | Konferenzbeitrag Inproceedings | 2016 |
| 14 | | Bliem, Bernhard ; Woltran, Stefan | Complexity of Secure Sets | Konferenzbeitrag Inproceedings | 2016 |
| 15 | | Bliem, Bernhard ; Charwat, Günther ; Hecher, Markus ; Woltran, Stefan | Subset Minimization in Dynamic Programming on Tree Decompositions | Konferenzbeitrag Inproceedings | 2016 |
| 16 | | Bichler, Manuel ; Morak, Michael ; Woltran, Stefan | lpopt: A Rule Optimization Tool for Answer Set Programming | Konferenzbeitrag Inproceedings | 2016 |
| 17 | | BICHLER, MANUEL ; MORAK, MICHAEL ; WOLTRAN, STEFAN | The Power of Non-Ground Rules in Answer Set Programming | Artikel Article | 2016 |
| 18 | | Bliem, Bernhard ; Charwat, Günther ; Hecher, Markus ; Woltran, Stefan | D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy | Artikel Article | 2016 |
| 19 | | Abseher, Michael ; Gebser, Martin ; Musliu, Nysret ; Schaub, Torsten ; Woltran, Stefan | Shift Design with Answer Set Programming | Artikel Article | 2016 |
| 20 | | Charwat, Günther ; Woltran, Stefan | Dynamic Programming-based QBF Solving | Konferenzbeitrag Inproceedings | 2016 |