|
| | Preview | Authors / Editors | Title | Type | Issue Date |
| 1 | | Fichte, Johannes ; Hecher, Markus ; Meier, Arne | Knowledge-Base Degrees of Inconsistency: Complexity and Counting | Konferenzbeitrag Inproceedings  | 2021 |
| 2 | | Fandinno, Jorge ; Hecher, Markus | Treewidth-Aware Complexity in {ASP:} Not all Positive Cycles are Equally Hard | Konferenzbeitrag Inproceedings | 2021 |
| 3 | | Bernreiter, Michael ; Maly, Jan ; Woltran, Stefan | Choice Logics and Their Computational Properties | Konferenzbeitrag Inproceedings | 2021 |
| 4 | | Fichte, Johannes ; Hecher, Markus ; Roland, Valentin | Parallel Model Counting with {CUDA:} Algorithm Engineering for Efficient Hardware Utilization | Konferenzbeitrag Inproceedings | 2021 |
| 5 | | Fichte, Johannes ; Hecher, Markus ; McCreesh, Ciaran ; Shahab, Anas | Complications for Computational Experiments from Modern Processors | Konferenzbeitrag Inproceedings | 2021 |
| 6 | | Fichte, Johannes ; Hecher, Markus ; Mahmood, Yasir ; Meier, Arne | Decomposition-Guided Reductions for Argumentation and Treewidth | Konferenzbeitrag Inproceedings | 2021 |
| 7 | | Dvořák, Wolfgang ; König, Matthias ; Woltran, Stefan | On the Complexity of Preferred Semantics in Argumentation Frameworks with Bounded Cycle Length | Konferenzbeitrag Inproceedings | 2021 |
| 8 | | Dvořák, Wolfgang ; König, Matthias ; Woltran, Stefan | Graph-Classes of Argumentation Frameworks with Collective Attacks | Konferenzbeitrag Inproceedings | 2021 |
| 9 | | Dvořák, Wolfgang ; Ulbricht, Markus ; Woltran, Stefan | Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility | Konferenzbeitrag Inproceedings | 2021 |
| 10 | | FICHTE, JOHANNES K. ; HECHER, MARKUS ; THIER, PATRICK ; WOLTRAN, STEFAN | Exploiting Database Management Systems and Treewidth for Counting | Artikel Article | 2021 |
| 11 | | Dvorak, Wolfgang ; König, Matthias ; Ulbricht, Markus ; Woltran, Stefan | A Reduct-Driven Study of Argumentation Frameworks With Collective Attacks | Präsentation Presentation | 2021 |
| 12 | | Eiter, Thomas ; Hecher, Markus ; Kiesel, Rafael | Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting | Konferenzbeitrag Inproceedings | 2021 |
| 13 | | Eiter, Thomas ; Hecher, Markus ; Kiesel, Rafael | Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting | Konferenzbeitrag Inproceedings | 2021 |
| 14 | | Fichte, Johannes K. ; Hecher, Markus ; Morak, Michael ; Woltran, Stefan | DynASP2.5: Dynamic Programming on Tree Decompositions in Action | Artikel Article | 2021 |
| 15 | | Hecher, Markus ; Thier, Patrick ; Woltran, Stefan | Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology | Konferenzbeitrag Inproceedings | 2020 |
| 16 | | Gonçalves, Ricardo ; Janhunen, Tomi ; Knorr, Matthias ; Leite, João ; Woltran, Stefan | Forgetting in Modular Answer Set Programming | Konferenzbeitrag Inproceedings | 2020 |
| 17 | | FICHTE, JOHANNES K. ; HECHER, MARKUS ; THIER, PATRICK ; WOLTRAN, STEFAN | Exploiting Database Management Systems and Treewidth for Counting | Konferenzbeitrag Inproceedings | 2020 |
| 18 | | Kolaitis, Phokion G. ; Pichler, Reinhard ; Sallinger, Emanuel ; Savenkov, Vadim | On the Language of Nested Tuple Generating Dependencies | Artikel Article | 2020 |
| 19 | | Saribatur, Zeynep Gözen ; Wallner, Johannes Peter ; Woltran, Stefan ; De Giacomo, Giuseppe | Explaining Non-Acceptability in Abstract Argumentation | Konferenzbeitrag Inproceedings | 2020 |
| 20 | | Fichte, Johannes K. ; Hecher, Markus ; Schidler, Andre | Solving the Steiner Tree Problem with few Terminals | Konferenzbeitrag Inproceedings | 2020 |
