|
| | Preview | Author(s) | Title | Type | Issue Date |
| 101 | | Fichte, Johannes ; Hecher, Markus ; Morak, Michael ; Woltran, Stefan | DynASP2.5: Dynamic Programming on Tree Decompositions in Action | Konferenzbeitrag Inproceedings | 2017 |
| 102 | | Fichte, Johannes ; Kronegger, Martin ; Woltran, Stefan | A Multiparametric View on Answer Set Programming | Konferenzbeitrag Inproceedings | 2017 |
| 103 | | Moldovan, Marius ; Bliem, Bernhard ; Morak, Michael ; Woltran, Stefan ; Bliem, Bernhard | The Impact of Treewidth on {ASP} Grounding and Solving | Konferenzbeitrag Inproceedings  | 2017 |
| 104 | | Maly, Jan ; Woltran, Stefan | Ranking Specific Sets of Objects | Konferenzbeitrag Inproceedings | 2017 |
| 105 | | Csar, Theresa ; Lackner, Martin ; Pichler, Reinhard ; Sallinger, Emanuel | Winner Determination in Huge Elections with MapReduce. AAAI 2017: 451-458 | Konferenzbeitrag Inproceedings | 2017 |
| 106 | | Barcelo, Pablo ; Gottlob, Georg ; Pieris, Andreas | Semantic Acyclicity Under Constraints | Konferenzbeitrag Inproceedings | 2016 |
| 107 | | Woltran, Stefan | Dynamic Programming on Tree Decompositions in Practice | Präsentation Presentation | 2016 |
| 108 | | Abseher, Michael ; Musliu, Nysret ; Woltran, Stefan | Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning | Bericht Report | 2016 |
| 109 | | Charwat, Günther ; Woltran, Stefan | BDD-based Dynamic Programming on Tree Decompositions | Bericht Report | 2016 |
| 110 | | Bichler, Manuel ; Bliem, Bernhard ; Moldovan, Marius ; Morak, Michael ; Woltran, Stefan | Treewidth-Preserving Modeling in ASP | Bericht Report | 2016 |
| 111 | | Abseher, Michael ; Musliu, Nysret ; Woltran, Stefan | htd -- A Free, Open-Source Framework for Tree Decompositions and Beyond | Bericht Report | 2016 |
| 112 | | Fichte, Johannes ; Kronegger, Martin ; Woltran, Stefan | Multiparametric View on Answer Set Programming | Bericht Report | 2016 |
| 113 | | Fichte, Johannes ; Szeider, Stefan | Backdoor Trees for Answer Set Programming | Bericht Report | 2016 |
| 114 | | Fichte, Johannes ; Hecher, Markus ; Morak, Michael ; Woltran, Stefan | Answer Set Solving using Tree Decompositions and Dynamic Programming -- The DynASP2 System | Bericht Report | 2016 |
| 115 | | Bliem, Bernhard ; Woltran, Stefan | Equivalence Between Answer-Set Programs Under (Partially) Fixed Input | Konferenzbeitrag Inproceedings | 2016 |
| 116 | | Berger, Gerald ; Pieris, Andreas | Ontology-Mediated Queries Distributing over Components | Konferenzbeitrag Inproceedings | 2016 |
| 117 | | Bliem, Bernhard ; Bredereck, Robert ; Niedermeier, Rolf | Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels | Konferenzbeitrag Inproceedings | 2016 |
| 118 | | Bliem, Bernhard ; Kaufmann, Benjamin ; Schaub, Torsten ; Woltran, Stefan | ASP for Anytime Dynamic Programming on Tree Decompositions | Konferenzbeitrag Inproceedings | 2016 |
| 119 | | Fichte, Johannes K. ; Meier, Arne ; Schindler, Irina | Strong Backdoors for Default Logic | Konferenzbeitrag Inproceedings | 2016 |
| 120 | | Bliem, Bernhard ; Hecher, Markus ; Woltran, Stefan | On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions | Konferenzbeitrag Inproceedings | 2016 |
