|
| | Preview | Author(s) | Title | Type | Issue Date |
| 81 | | Delgrande, James P. ; Peppas, Pavlos ; Woltran, Stefan | General Belief Revision | Artikel Article  | 2018 |
| 82 | | Creignou, Nadia ; Pichler, Reinhard ; Woltran, Stefan | Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? | Artikel Article | 2018 |
| 83 | | Fichte, Johannes ; Hecher, Markus ; Woltran, Stefan ; Zisser, Markus | Weighted Model Counting on the GPU by Exploiting Small Treewidth | Konferenzbeitrag Inproceedings | 2018 |
| 84 | | Bliem, Bernhard | ASP Programs with Groundings of Small Treewidth | Konferenzbeitrag Inproceedings | 2018 |
| 85 | | Bliem, Bernhard ; Woltran, Stefan | Equivalence between answer-set programs under (partially) fixed input | Artikel Article | 2018 |
| 86 | | Dvorak, Wolfgang ; Woltran, Stefan ; Gressler, Alexander | Evaluating SETAFs via Answer-Set Programming | Konferenzbeitrag Inproceedings | 2018 |
| 87 | | Woltran, Stefan ; Schaub, Torsten | Answer set programming unleashed! | Artikel Article | 2018 |
| 88 | | Abseher, Michael ; Hecher, Markus ; Moldovan, Marius ; Woltran, Stefan ; Bliem, Bernhard | Dynamic Programming on Tree Decompositions with {D-FLAT} | Artikel Article | 2018 |
| 89 | | Morak, Michael ; Pieris, Andreas ; Bourhis, Pierre | Making Cross Products and Guarded Ontology Languages Compatible | Konferenzbeitrag Inproceedings | 2017 |
| 90 | | 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 |
| 91 | | Csar, Theresa ; Lackner, Martin ; Pichler, Reinhard ; Sallinger, Emanuel | Computational Social Choice in the Clouds | Konferenzbeitrag Inproceedings | 2017 |
| 92 | | Morak, Michael ; Bichler, Manuel ; Woltran, Stefan | lpopt: A Rule Optimization Tool for Answer Set Programming | Konferenzbeitrag Inproceedings | 2017 |
| 93 | | Pieris, Andreas ; Morak, Michael ; Alviano, Mario | Stable Model Semantics for Tuple-Generating Dependencies Revisited | Konferenzbeitrag Inproceedings | 2017 |
| 94 | | Charwat, Günther ; Woltran, Stefan | Expansion-based (QBF) Solving on Tree Decompositions | Konferenzbeitrag Inproceedings | 2017 |
| 95 | | Hecher, Markus | Structure-Driven Answer-Set Solving | Konferenzbeitrag Inproceedings | 2017 |
| 96 | | Bliem, Bernhard ; Moldovan, Marius ; Morak, Michael ; Woltran, Stefan | The Impact of Treewidth on ASP Grounding and Solving | Konferenzbeitrag Inproceedings | 2017 |
| 97 | | Abseher, Michael ; Musliu, Nysret ; Woltran, Stefan | htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond | Konferenzbeitrag Inproceedings | 2017 |
| 98 | | Maly, Jan ; Woltran, Stefan | Ranking Specific Sets of Objects | Artikel Article | 2017 |
| 99 | | Egly, Uwe ; Kronegger, Martin ; Lonsing, Florian ; Pfandler, Andreas | Conformant planning as a case study of incremental QBF solving | Artikel Article | 2017 |
| 100 | | Abseher, Michael ; Musliu, Nysret ; Woltran, Stefan | Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning | Artikel Article | 2017 |
