|
| | Preview | Author(s) | Title | Type | Issue Date |
| 1 | | Ganian, Robert ; Kronegger, Martin ; Pfandler, Andreas ; Popa, Alexandru | Parameterized Complexity of Asynchronous Border Minimization | Artikel Article  | 2019 |
| 2 | | Baumann, Ringo ; Dvorak, Wolfgang ; Linsbichler, Thomas ; Woltran, Stefan | A general notion of equivalence for abstract argumentation | Artikel Article | 2019 |
| 3 | | Kronegger, Martin ; Ordyniak, Sebastian ; Pfandler, Andreas | Backdoors to planning | Artikel Article | 2019 |
| 4 | | Charwat, Günther ; Woltran, Stefan | Expansion-based QBF Solving on Tree Decompositions | Artikel Article | 2019 |
| 5 | | Bliem, Bernhard ; Woltran, Stefan | Defensive alliances in graphs of bounded treewidth | Artikel Article | 31-Dec-2018 |
| 6 | | 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 |
| 7 | | Bliem, Bernhard ; Woltran, Stefan | Complexity of Secure Sets | Artikel Article | 2018 |
| 8 | | Delgrande, James P. ; Peppas, Pavlos ; Woltran, Stefan | General Belief Revision | Artikel Article | 2018 |
| 9 | | Creignou, Nadia ; Pichler, Reinhard ; Woltran, Stefan | Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? | Artikel Article | 2018 |
| 10 | | Bliem, Bernhard ; Woltran, Stefan | Equivalence between answer-set programs under (partially) fixed input | Artikel Article | 2018 |
| 11 | | Woltran, Stefan ; Schaub, Torsten | Answer set programming unleashed! | Artikel Article | 2018 |
| 12 | | Abseher, Michael ; Hecher, Markus ; Moldovan, Marius ; Woltran, Stefan ; Bliem, Bernhard | Dynamic Programming on Tree Decompositions with {D-FLAT} | Artikel Article | 2018 |
| 13 | | 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 |
| 14 | | Maly, Jan ; Woltran, Stefan | Ranking Specific Sets of Objects | Artikel Article | 2017 |
| 15 | | Egly, Uwe ; Kronegger, Martin ; Lonsing, Florian ; Pfandler, Andreas | Conformant planning as a case study of incremental QBF solving | Artikel Article | 2017 |
| 16 | | Abseher, Michael ; Musliu, Nysret ; Woltran, Stefan | Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning | Artikel Article | 2017 |
| 17 | | Bourhis, Pierre ; Manna, Marco ; Morak, Michael ; Pieris, Andreas | Guarded-Based Disjunctive Tuple-Generating Dependencies | Artikel Article | 2016 |
| 18 | | BICHLER, MANUEL ; MORAK, MICHAEL ; WOLTRAN, STEFAN | The Power of Non-Ground Rules in Answer Set Programming | Artikel Article | 2016 |
| 19 | | 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 |
| 20 | | Abseher, Michael ; Gebser, Martin ; Musliu, Nysret ; Schaub, Torsten ; Woltran, Stefan | Shift Design with Answer Set Programming | Artikel Article | 2016 |
