|
| | Preview | Author(s) | Title | Type | Issue Date |
| 1 | | Fichte, Johannes K. ; Hecher, Markus ; Morak, Michael ; Woltran, Stefan | DynASP2.5: Dynamic Programming on Tree Decompositions in Action | Artikel Article  | 2021 |
| 2 | | FICHTE, JOHANNES K. ; HECHER, MARKUS ; THIER, PATRICK ; WOLTRAN, STEFAN | Exploiting Database Management Systems and Treewidth for Counting | Artikel Article | 2021 |
| 3 | | Abseher, Michael ; Bliem, Bernhard ; Charwat, Günther ; Dusberger, Frederico ; Woltran, Stefan | Computing Secure Sets in Graphs using Answer Set Programming | Artikel Article | Jun-2020 |
| 4 | | Dvořák, Wolfgang ; Woltran, Stefan | Complexity of abstract argumentation under a claim-centric view | Artikel Article | 2020 |
| 5 | | Gaggl, Sarah A. ; Linsbichler, Thomas ; Maratea, Marco ; Woltran, Stefan | Design and results of the Second International Competition on Computational Models of Argumentation | Artikel Article | 2020 |
| 6 | | Bliem, Bernhard ; Morak, Michael ; Moldovan, Marius ; Woltran, Stefan | The Impact of Treewidth on Grounding and Solving of Answer Set Programs | Artikel Article | 2020 |
| 7 | | Baumann, Ringo ; Dvorak, Wolfgang ; Linsbichler, Thomas ; Woltran, Stefan | A general notion of equivalence for abstract argumentation | Artikel Article | 2019 |
| 8 | | Charwat, Günther ; Woltran, Stefan | Expansion-based QBF Solving on Tree Decompositions | Artikel Article | 2019 |
| 9 | | Bliem, Bernhard ; Woltran, Stefan | Defensive alliances in graphs of bounded treewidth | Artikel Article | 31-Dec-2018 |
| 10 | | Diller, Martin ; Haret, Adrian ; Linsbichler, Thomas ; Rümmele, Stefan ; Woltran, Stefan | An extension-based approach to belief revision in abstract argumentation | Artikel Article | Feb-2018 |
| 11 | | Bliem, Bernhard ; Woltran, Stefan | Complexity of Secure Sets | Artikel Article | 2018 |
| 12 | | Delgrande, James P. ; Peppas, Pavlos ; Woltran, Stefan | General Belief Revision | Artikel Article | 2018 |
| 13 | | Creignou, Nadia ; Pichler, Reinhard ; Woltran, Stefan | Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? | Artikel Article | 2018 |
| 14 | | Bliem, Bernhard ; Woltran, Stefan | Equivalence between answer-set programs under (partially) fixed input | Artikel Article | 2018 |
| 15 | | Woltran, Stefan ; Schaub, Torsten | Answer set programming unleashed! | Artikel Article | 2018 |
| 16 | | Abseher, Michael ; Hecher, Markus ; Moldovan, Marius ; Woltran, Stefan ; Bliem, Bernhard | Dynamic Programming on Tree Decompositions with {D-FLAT} | Artikel Article | 2018 |
| 17 | | GONÇALVES, RICARDO ; KNORR, MATTHIAS ; LEITE, JOÃO ; WOLTRAN, STEFAN | When you must forget: Beyond strong persistence when forgetting in answer set programming | Artikel Article | 2017 |
| 18 | | Maly, Jan ; Woltran, Stefan | Ranking Specific Sets of Objects | Artikel Article | 2017 |
| 19 | | Abseher, Michael ; Musliu, Nysret ; Woltran, Stefan | Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning | Artikel Article | 2017 |
| 20 | | BICHLER, MANUEL ; MORAK, MICHAEL ; WOLTRAN, STEFAN | The Power of Non-Ground Rules in Answer Set Programming | Artikel Article | 2016 |
