| | Preview | Author(s) | Title | Type | Issue Date |
| 1 | | Moser, Bernhard ; Dorffner, Georg ; Eiter, Thomas ; Faber, Wolfgang ; Klambauer, Günther ; Legenstein, Robert ; Nessler, Bernhard ; Polleres, Axel ; Woltran, Stefan | Österreichische AI Strategie aus Sicht der Wissenschaft | Artikel Article | 2020 |
| 2 | | Eiter, Thomas ; Strass, Hannes ; Truszczynski, Miroslaw ; Woltran, Stefan | A Glimpse on Gerhard Brewka's Contributions to Artificial Intelligence | Buchbeitrag Book Contribution | 2015 |
| 3 | | Eiter, Thomas ; Fink, Michael ; Puehrer, Joerg ; Tompits, Hans ; Woltran, Stefan | Model-Based Recasting in Answer-Set Programming | Bericht Report | 2013 |
| 4 | | Eiter, Thomas ; Fink, Michael ; Pührer, Jörg ; Tompits, Hans ; Woltran, Stefan | Model-Based Recasting in Answer-Set Programming | Artikel Article | 2013 |
| 5 | | Eiter, Thomas ; Fink, Michael ; Tompits, Hans ; Woltran, Stefan | Complexity Results for Checking Equivalence of Stratified Logic Programs | Konferenzbeitrag Inproceedings | 2007 |
| 6 | | Eiter, Thomas ; Fink, Michael ; Woltran, Stefan | Semantical Characterizations and Complexity of Equivalences in Answer Set Programming | Artikel Article | 2007 |
| 7 | | Eiter, Thomas ; Faber, Wolfgang ; Fink, Michael ; Woltran, Stefan | Complexity results for answer set programming with bounded predicate arities and implications | Artikel Article | 2007 |
| 8 | | Eiter, Thomas ; Fink, Michael ; Tompits, Hans ; Traxler, Patrick ; Woltran, Stefan | Replacements in Non-Ground Answer-Set Programming | Konferenzbeitrag Inproceedings | 2006 |
| 9 | | Eiter, Thomas ; Fink, Michael ; Tompits, Hans ; Traxler, Patrick ; Woltran, Stefan | Replacements in Non-Ground Answer-Set Programming | Konferenzbeitrag Inproceedings | 2006 |
| 10 | | Eiter, Thomas ; Traxler, Patrick ; Woltran, Stefan | An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs | Konferenzbeitrag Inproceedings | 2006 |
| 11 | | Eiter, Thomas ; Fink, Michael ; Woltran, Stefan | Semantical Characterizations and Complexity of Equivalences in Answer Set Programming | Bericht Report | 2005 |
| 12 | | Eiter, Thomas ; Fink, Michael ; Tompits, Hans ; Woltran, Stefan | Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case | Konferenzbeitrag Inproceedings | 2005 |
| 13 | | Eiter, Thomas ; Tompits, Hans ; Woltran, Stefan | On Solution Correspondences in Answer-Set Programming | Konferenzbeitrag Inproceedings | 2005 |
| 14 | | Eiter, Thomas ; Faber, Wolfgang ; Fink, Michael ; Woltran, Stefan ; Zalewska, Lilianna | Methods for data acquisition and transformation | Bericht Report | 2003 |
| 15 | | Eiter, Thomas ; Fink, Michael ; Tompits, Hans ; Woltran, Stefan | On Eliminating Disjunctions in Stable Logic Programming | Bericht Report | 2003 |
| 16 | | Eiter, Thomas ; Faber, Wolfgang ; Pfeifer, Gerald ; Fink, Michael ; Woltran, Stefan | Complexity of Answer Set Checking and Bounded Predicate Arities for Non-Ground Answer Set Programming | Bericht Report | 2003 |