|
| | Preview | Author(s) | Title | Type | Issue Date |
| 1 |  | Fichte, Johannes K. ; Le Berre, Daniel ; Hecher, Markus ; Szeider, Stefan | The silent (r)evolution of SAT | Article Artikel    | Jun-2023 |
| 2 | | Fichte, Johannes K. ; Hecher, Markus ; Morak, Michael ; Woltran, Stefan | DynASP2.5: Dynamic Programming on Tree Decompositions in Action | Artikel Article | 2021 |
| 3 | | FICHTE, JOHANNES K. ; HECHER, MARKUS ; THIER, PATRICK ; WOLTRAN, STEFAN | Exploiting Database Management Systems and Treewidth for Counting | Artikel Article | 2021 |
| 4 | | Abseher, Michael ; Bliem, Bernhard ; Charwat, Günther ; Dusberger, Frederico ; Woltran, Stefan | Computing Secure Sets in Graphs using Answer Set Programming | Artikel Article | Jun-2020 |
| 5 | | Kolaitis, Phokion G. ; Pichler, Reinhard ; Sallinger, Emanuel ; Savenkov, Vadim | On the Language of Nested Tuple Generating Dependencies | Artikel Article | 2020 |
| 6 | | Dvořák, Wolfgang ; Woltran, Stefan | Complexity of abstract argumentation under a claim-centric view | Artikel Article | 2020 |
| 7 | | 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 |
| 8 | | Bliem, Bernhard ; Morak, Michael ; Moldovan, Marius ; Woltran, Stefan | The Impact of Treewidth on Grounding and Solving of Answer Set Programs | Artikel Article | 2020 |
