2019W

• Abstract Argumentation / VU / 184.682
• Bachelor Thesis / PR / 184.691
• Doctoral & Master Students Seminar / SE / 181.223
• Formal Methods in Computer Science / VU / 185.291
• Introduction to Logical Methods in Computer Science / VO / 184.766
• Project in Computer Science 1 / PR / 184.688
• Project in Computer Science 2 / PR / 184.689
• Research Seminar LogiCS / SE / 184.767
• Seminar in Complexity Theory / SE / 184.687
• Seminar in Theoretical Computer Science / SE / 192.064

• Hybrid Parameterized Problem Solving in Practice
  2019 – 2022 / Austrian Science Fund (FWF)
• Advanced Tools for Graph - Based Formal Argumentation
  2016 – 2019 / Austrian Science Fund (FWF)
• START
  2014 – 2020 / Austrian Science Fund (FWF)
• Extending the Answer-Set Programming Paradigm to Decomposed Problem Solving
  2013 – 2017 / Austrian Science Fund (FWF)
• Abstract Dialectical Frameworks: Advanced Tools for Formal Argumentation
  2013 – 2016 / Austrian Science Fund (FWF)
• Fragment-Driven Belief Change
  2013 – 2017 / Austrian Science Fund (FWF)
• Complexity of Argumentation
  2011 – 2013 / Austrian Exchange Service (OeAD)
• New Methods for Analyzing, Comparing, and Solving Argumentation Problems
  2009 – 2012 / Vienna Science and Technology Fund (WWFT)
• Formal Methods for Optimizing Nonmonotonic Logic Programs
  2005 – 2008 / Austrian Science Fund (FWF)
• QUIP--A computational framework for advanced reasoning tasks
  2001 – 2004 / Austrian Science Fund (FWF)

2019

• A Multiparametric View on Answer Set Programming / J. Fichte, M. Kronegger, S. Woltran / Annals of Mathematics and Artificial Intelligence (invited), 86 (2019), 1-3; 121 - 147

2018

• Solving (Q)SAT Problems via Tree Decomposition and Dynamic Programming / S. Woltran / Keynote Lecture: JFPC (Journées Francophones de Programmation par Contraintes), Amiens, Frankreich (invited); 2018-06-13 - 2018-06-15
• Expressibility of Argumentation Frameworks and its Relation to the Dynamics of Argumentation / S. Woltran / Keynote Lecture: AMANDE Workshop, Toulouse, Frankreich (invited); 2018-04-09 - 2018-04-12
• Abstract Dialectical Frameworks / G. Brewka, St. Ellmauthaler, H. Strass, J. P. Wallner, S. Woltran / in: "Handbook of Formal Argumentation", P. Baroni, D.M. Gabbay, M. Giacomin, L. van der Torre (ed.); College Publications, http://www.collegepublications.co.uk/handbooks/, 2018, ISBN: 978-1-84890-275-6, 237 - 285
• Foundations of Information and Knowledge Systems - 10th International Symposium, FoIKS 2018, Budapest, Hungary, May 14-18, 2018, Proceedings / F. Ferrarotti, S. Woltran / in series "LNCS", series editor: G. Goos, J. Hartmanis, J. van Leeuwen; Springer, 2018, ISBN: 978-3-319-90049-0
• An extension-based approach to belief revision in abstract argumentation / A. Haret, S. Woltran, T. Linsbichler, St. Rümmele, M. Diller / International Journal of Approximate Reasoning, 93 (2018), 395 - 423
• Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? / N. Creignou, R. Pichler, S. Woltran / Logical Methods in Computer Science, 14 (2018), 4; 1 - 25
• General Belief Revision / J. Delgrande, P. Peppas, S. Woltran / Journal of the ACM, 65 (2018), 5; 29:1 - 29:34
• Dynamic Programming on Tree Decompositions with {D-FLAT} / M. Abseher, M. Hecher, M. Moldovan, S. Woltran, B. Bliem / KI - Künstliche Intelligenz, 32 (2018), 2-3; 191 - 192
• Answer set programming unleashed! / S. Woltran, T. Schaub / KI - Künstliche Intelligenz, 32 (2018), 2-3; 105 - 108
• Summary Report of the Second International Competition on Computational Models of Argumentation / S. Gaggl, T. Linsbichler, M. Maratea, S. Woltran / AI Magazine, 39 (2018), 4; 77 - 79
• Defensive alliances in graphs of bounded treewidth / B. Bliem, S. Woltran / Discrete Applied Mathematics, 251 (2018), 251; 334 - 339
• Equivalence between answer-set programs under (partially) fixed input / B. Bliem, S. Woltran / Annals of Mathematics and Artificial Intelligence, 83 (2018), 3-4; 277 - 295
• Complexity of Secure Sets / B. Bliem, S. Woltran / Algorithmica, 80 (2018), 10; 2909 - 2940
• Abstract Solvers for Dung's Argumentation Frameworks / R. Brochenin, T. Linsbichler, M. Maratea, J. P. Wallner, S. Woltran / Argument & Computation, 9 (2018), 1; 41 - 72
• Special Issue on Answer Set Programming / T. Schaub, S. Woltran / KI - Künstliche Intelligenz, 32 (2018), 2-3; 101 - 103
• Special Issue on Computational Logic in Multi-Agent Systems (CLIMA XIV) / J. Leite, C. Tran, P. Torroni, S. Woltran / Journal of Logic and Computation, 28 (2018), 3; 475 - 476
• Two Sides of the Same Coin: Belief Revision and Enforcing Arguments / A. Haret, J. P. Wallner, S. Woltran / Talk: International Joint Conference on Artificial Intelligence (IJCAI), Stockholm; 2018-07-13 - 2018-07-19; in: "Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence", J. Lang (ed.); IJCAI, (2018), 1854 - 1860
• Application of ASP in formal argumentation / W. Dvorak, J. Pührer, J. P. Wallner, S. Woltran, M. Diller / Talk: TAASP - Workshop on Trends and Applications of Answer Set Programming, Wien; 2018-11-19 - 2018-11-20; in: "2nd Workshop on Trends and Applications of Answer Set Programming (TAASP 2018)", (2018), 1 - 11
• Investigating Subclasses of Abstract Dialectical Frameworks / A. Keshavarzi Zafarghandi, T. Linsbichler, S. Woltran, M. Diller / Talk: COMMA - International Conference on Computational Models of Argument, Warsaw, Poland; 2018-09-12 - 2018-09-14; in: "Computational Models of Argument - Proceedings of {COMMA} 2018", IOS Press, 305 (2018), ISBN: 978-1-61499-905-8; 61 - 72
• A Single-Shot Epistemic Logic Program Solver / M. Bichler, M. Morak, S. Woltran / Talk: Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP) 2010, Oxford; 2018-07-09 - 2018-07-12; in: "11th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2018)", (2018), 1 - 14
• Belief Revision Operators with Varying Attitudes Towards Initial Beliefs / A. Haret, S. Woltran / Talk: International Workshop on Non-Monotonic Reasoning (NMR), Tempe, Arizona, USA; 2018-10-27 - 2018-10-29; in: "17th International Workshop On Non-Monotonic Reasoning", (2018), 156 - 165
• Weighted Model Counting on the GPU by Exploiting Small Treewidth / J. Fichte, M. Hecher, S. Woltran, M. Zisser / Talk: European Symposium on Algorithms (ESA), Helsinki, Finnland; 2018-08-20 - 2018-08-24; in: "26th Annual European Symposium on Algorithms, {ESA} 2018", Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 112 (2018), ISBN: 978-3-95977-081-1; 1 - 16
• Evaluating SETAFs via Answer-Set Programming / W. Dvorak, S. Woltran, A. Gressler / Talk: 2nd International Workshop on Systems and Algorithms for Formal Argumentation, Warschau; 2018-09-11; in: "2nd International Workshop on Systems and Algorithms for Formal Argumentation", CEUR-WS.org, 2171 (2018), ISSN: 1613-0073; 10 - 21
• On the Expressive Power of Collective Attacks / W. Dvorak, S. Woltran, J. Fandinno / Talk: 7th International Conference on Computational Models of Argument, Warschau; 2018-09-11 - 2018-09-14; in: "7th International Conference on Computational Models of Argument", IOS Press, 305 (2018), ISBN: 978-1-61499-905-8; 1 - 27
• Belief Update in the Horn Fragment / A. Haret, N. Creignou, O. Papini, S. Woltran / Talk: IJCAI - International Joint Conference on Artificial Intelligence, Stockholm; 2018-07-13 - 2018-07-19; in: "Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, {IJCAI} 2018", ijcai.org, 27 (2018), ISBN: 978-0-9992411-2-7; 1781 - 1787
• A New Logic for Jointly Representing Hard and Soft Constraints / J. Maly, S. Woltran / Talk: Workshop on Logics for Reasoning about Preferences, Uncertainty, and Vagueness (PRUV), Oxford; 2018-07-19; in: "Second Workshop on Logics for Reasoning about Preferences, Uncertainty, and Vagueness", (2018), 1 - 4
• Variable Elimination for DLP-Functions / S. Woltran, R. Goncalves, T. Janhunen, M. Knorr, J. Leite / Talk: Principles of Knowledge Representation and Reasoning (KR), Tempe, Arizona, USA; 2018-10-27 - 2018-11-02; in: "AAAI Publications, Sixteenth International Conference on Principles of Knowledge Representation and Reasoning", AAAI, (2018), 643 - 644
• Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? / J. Maly, S. Woltran, M. Truszczynski / Talk: IJCAI - International Joint Conference on Artificial Intelligence, Stockholm; 2018-07-13 - 2018-07-19; in: "Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, {IJCAI} 2018", ijcai.org, (2018), ISBN: 978-0-9992411-2-7; 433 - 439
• Single-Shot Epistemic Logic Program Solving / M. Bichler, M. Morak, S. Woltran / Talk: IJCAI - International Joint Conference on Artificial Intelligence, Stockholm; 2018-07-13 - 2018-07-19; in: "Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, {IJCAI} 2018", ijcai.org, (2018), ISBN: 978-0-9992411-2-7; 1714 - 1720
• Exploiting Treewidth for Projected Model Counting and Its Limits / J. Fichte, M. Hecher, M. Morak, S. Woltran / Talk: Theory and Applications of Satisfiability Testing - (SAT), Oxford, UK; 2018-07-09 - 2018-07-12; in: "Theory and Applications of Satisfiability Testing - (SAT 2018) - 21st International Conference, (SAT 2018)Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings", Springer, (2018), ISBN: 978-3-319-94143-1; 165 - 184
• Weighted Abstract Dialectical Frameworks / G. Brewka, H. Strass, J. P. Wallner, S. Woltran / Talk: AAAI Conference, New Orleans, Louisiana, USA; 2018-02-02 - 2018-02-07; in: "Proceedings AAAI 2018", S. McIlraith, K. Weinberger (ed.); AAAI Press, (2018), 1779 - 1786
• Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving / T. Linsbichler, M. Maratea, A. Niskanen, J. P. Wallner, S. Woltran / Talk: International Joint Conference on Artificial Intelligence (IJCAI), Stockholm; 2018-07-13 - 2018-07-19; in: "Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence", J. Lang (ed.); IJCAI, (2018), 1905 - 1911

2017

• Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning / M. Abseher, N. Musliu, S. Woltran / Journal of Artificial Intelligence Research, 58 (2017), 829 - 858
• Abstract Dialectical Frameworks. An Overview / G. Brewka, St. Ellmauthaler, H. Strass, J. P. Wallner, S. Woltran / IfCoLog Journal of Logics and their Applications, 4 (2017), 8; 2263 - 2318
• Merging in the Horn Fragment / A. Haret, St. Rümmele, S. Woltran / ACM Transactions on Computational Logic, 18 (2017), 1; 1 - 32
• Ranking Specific Sets of Objects / J. Maly, S. Woltran / Datenbank Spektrum - Zeitschrift für Datenbanktechnologie und Information Retrieval, 17 (2017), 3; 255 - 265
• When you must forget: Beyond strong persistence when forgetting in answer set programming / R. Goncalves, M. Knorr, J. Leite, S. Woltran / Theory and Practice of Logic Programming, 17 (2017), 5-6; 837 - 854
• Implementing Courcelle's Theorem in a declarative framework for dynamic programming / B. Bliem, R. Pichler, S. Woltran / Journal of Logic and Computation, 27 (2017), 4; 1067 - 1094
• lpopt: A Rule Optimization Tool for Answer Set Programming / M. Morak, M. Bichler, S. Woltran / Poster: 26th InternationalSymposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016), Edinburgh, UK; 2017-09-06 - 2017-09-08; in: "Proceedings of the 26th InternationalSymposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016)", M. Hermenegildo, P. Lopez-Garcia (ed.); Lecture Notes in Computer Science, 10184 (2017), ISBN: 978-3-319-63138-7; 114 - 130
• Deviation in Belief Change on Fragments of Propositional Logic / A. Haret, S. Woltran / Talk: 6th Workshop on Dynamics of Knowledge and Belief (DKB-2017) and 5th Workshop KI & Kognition (KIK-2017) on Formal and Cognitive Reasoning, Dortmund; 2017-09-26; in: "Proceedings of the 6th Workshop on Dynamics of Knowledge and Belief (DKB-2017) and the 5th Workshop KI & Kognition (KIK-2017)", C. Beierle, G. Kern-Isberner, M. Ragni, F. Stolzenburg (ed.); CEUR Workshop Proceedings, 1928 (2017), ISSN: 1613-0073; Paper ID 6, 13 pages
• Solving Advanced Argumentation Problems with Answer-Set Programming / M. Diller, T. Linsbichler, S. Woltran, G. Brewka, G. Heissenberger / Talk: Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17), San Francisco, California, USA; 2017-02-04 - 2017-02-09; in: "Proceedings of the 31st AAAI Conference on Artificial Intelligence", (2017), 1077 - 1083
• The Impact of Treewidth on ASP Grounding and Solving / B. Bliem, M. Moldovan, M. Morak, S. Woltran / Talk: 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia; 2017-08-19 - 2017-08-25; in: "Proc. of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017)", AAAI Press, (2017), 852 - 858
• DynASP2.5: Dynamic Programming on Tree Decompositions in Action / J. Fichte, M. Hecher, M. Morak, S. Woltran / Talk: International Symposium on Parameterized and Exact Computation (IPEC), TU Wien; 2017-09-04 - 2017-09-08; in: "Proceedings of the 12th International Symposium on Parameterized and Exact Computation (IPEC'17)", D. Lokshtanov, N. Nishimura (ed.); (2017), 1 - 13
• The Impact of Treewidth on {ASP} Grounding and Solving / M. Moldovan, B. Bliem, M. Morak, S. Woltran, B. Bliem / Talk: 4th International Workshop on Grounding and Transformations for Theories with Variables (GTTV 2017), Espoo, Helsinki; 2017-07-03; in: "Proceedings of the 4th International Workshop on Grounding and Transformations for Theories with Variables (GTTV 2017)", (2017), 1 - 13
• Towards Preprocessing for Abstract Argumentation Frameworks / S. Woltran / Talk: International Workshop on Defeasible and Ampliative Reasoning 2017, Espoo, Finnland (invited); 2017-07-03; in: "Proceedings of the 4th International Workshop on Defeasible and Ampliative Reasoning (DARe-17)", (2017), 1
• Expansion-based (QBF) Solving on Tree Decompositions / G. Charwat, S. Woltran / Talk: 24th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA@AI*IA 2017), Bari, Italien; 2017-11-14 - 2017-11-15; in: "Proceedings of the 24th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA@AI*IA 2017)", M. Maratea, I. Serina (ed.); CEUR-WS.org, 2011 (2017), 16 - 26
• On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks / M. Kröll, R. Pichler, S. Woltran / Talk: 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia; 2017-08-19 - 2017-08-25; in: "Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017", (2017), 1145 - 1152
• htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond / M. Abseher, N. Musliu, S. Woltran / Talk: 14th International Conference on Integration of AI and OR Teniques (CPAIOR) 2017, Padua, Italien; 2017-06-05 - 2017-06-08; in: "CPAIOR 2017", Lecture Notes in Computer Science / Springer, 10335 (2017), ISBN: 978-3-319-59775-1; 376 - 386
• Answer Set Solving with Bounded Treewidth Revisited / M. Hecher, J. Fichte, M. Morak, S. Woltran / Talk: 14th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2017), Helsinki, Finland; 2017-07-03 - 2017-07-06; in: "Proc. of the 14th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2017)", M. Balduccini, T. Janhunen (ed.); Springer, (2017), 132 - 145
• Ranking Specific Sets of Objects / J. Maly, S. Woltran / Talk: Workshop Präferenzen und Personalisierung in der Informatik, Stuttgart; 2017-03-07; in: "Workshop Präferenzen und Personalisierung in der Informatik", (2017), 193 - 201
• A Multiparametric View on Answer Set Programming / J. Fichte, M. Kronegger, S. Woltran / Talk: 14th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2017), Helsinki, Finland; 2017-07-03 - 2017-07-06; in: "Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning (ASPOCP@LPNMR'17)", (2017), 1 - 14
• A General Notion of Equivalence for Abstract Argumentation / W. Dvorak, T. Linsbichler, S. Woltran, R. Baumann / Talk: 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia; 2017-08-19 - 2017-08-25; in: "IJCAI 2017", (2017), 800 - 806

2016

• Dynamic Programming on Tree Decompositions in Practice / S. Woltran / Keynote Lecture: 8th European Starting AI Researcher Symposium, Den Haag (invited); 2016-08-29 - 2016-08-30
• The role of self-attacking arguments in characterizations of equivalence notions / R. Baumann, S. Woltran / Journal of Logic and Computation, 26 (2016), 4; 1293 - 1313
• On rejected arguments and implicit conflicts: The hidden power of argumentation semantics / R. Baumann, W. Dvorak, T. Linsbichler, C. Spanring, H. Strass, S. Woltran / Artificial Intelligence, 241 (2016), 244 - 284
• Belief Merging within Fragments of Propositional Logic / N. Creignou, O. Papini, St. Rümmele, S. Woltran / ACM Transactions on Computational Logic, 17 (2016), 3; 20:1 - 20:28
• Shift Design with Answer Set Programming / M. Abseher, M. Gebser, N. Musliu, T. Schaub, S. Woltran / Fundamenta Informaticae, 147 (2016), 1; 1 - 25
• D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy / B. Bliem, G. Charwat, M. Hecher, S. Woltran / Fundamenta Informaticae, 147 (2016), 1; 27 - 61
• The Power of Non-Ground Rules in Answer Set Programming / M. Bichler, M. Morak, S. Woltran / Theory and Practice of Logic Programming, 16 (2016), 5-6; 552 - 569
• Towards advanced systems for abstract argumentation / S. Woltran / Keynote Lecture: First International Workshop on Systems and Algorithms for Formal Argumentation (SAFA 2016), Potsdam (invited); 2016-09-13; in: "Proceedings of the First International Workshop on Systems and Algorithms for Formal Argumentation", M. Thimm, F. Cerutti, H. Strass, M. Vallati (ed.); CEUR Workshop Proceedings, 1672 (2016), 3 pages
• Grappavis - A system for advanced graph-based argumentation / G. Heissenberger, S. Woltran / Poster: 6th International Conference on Computational Models of Argument (COMMA 2016), Potsdam; 2016-09-12 - 2016-09-16; in: "Computational Models of Argument - Proceedings of COMMA 2016", P. Baroni, Th. F. Gordon, T. Scheffler, M. Stede (ed.); IOS Press, Frontiers in Artificial Intelligence and Applications 287 (2016), ISBN: 978-1-61499-685-9; 473 - 474
• lpopt: A Rule Optimization Tool for Answer Set Programming / M. Bichler, M. Morak, S. Woltran / Talk: International Symposium on Logic-Based Program Synthesis and Transformation, Edinburgh, UK; 2016-09-06 - 2016-09-08; in: "Pre-proceedings of the 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016)", M. Hermenegildo, P. Lopez-Garcia (ed.); (2016), 14 pages
• Verifiability of argumentation semantics / R. Baumann, T. Linsbichler, S. Woltran / Talk: 16th International Workshop on Non-monotonic reasoning (NMR 2016), Kapstadt; 2016-04-22 - 2016-04-24; in: "Proceedings of the 16th International Workshop on Non-monotonic reasoning", G. Kern-Isberner, R. Wassermann (ed.); (2016), 10 pages
• Distributing Knowledge Into Simple Bases / A. Haret, J. Mailly, S. Woltran / Talk: 16th International Workshop on Non-monotonic reasoning (NMR 2016), Kapstadt; 2016-04-22 - 2016-04-24; in: "Proceedings of the 16th International Workshop on Non-monotonic reasoning", G. Kern-Isberner, R. Wassermann (ed.); (2016), 9 pages
• Revision of abstract dialectical frameworks: Preliminary report / T. Linsbichler, S. Woltran / Talk: First international Workshop on Argumentation in Logic Programming and Non-Monotonic Reasoning (Arg-LPNMR 2016), New York; 2016-07-10; in: "Proceedings of the First international Workshop on Argumentation in Logic Programming and Non-Monotonic Reasoning", S. Gaggl, J. Nieves, H. Strass (ed.); (2016), 8 pages
• Introducing the Second International Competition on Computational Models of Argumentation / S. Gaggl, T. Linsbichler, M. Maratea, S. Woltran / Talk: First International Workshop on Systems and Algorithms for Formal Argumentation (SAFA 2016), Potsdam; 2016-09-13; in: "Proceedings of the First International Workshop on Systems and Algorithms for Formal Argumentation", M. Thimm, F. Cerutti, H. Strass, M. Vallati (ed.); CEUR Workshop Proceedings, 1672 (2016), 6 pages
• Clique-Width and Directed Width Measures for Answer-Set Programming / B. Bliem, S. Ordyniak, S. Woltran / Talk: Workshop on Trends and Applications of Answer Set Programming, Klagenfurt, Austria; 2016-09-26; in: "Proceedings of the Workshop on Trends and Applications of Answer Set Programming (TAASP 2016)", T. Eiter, W. Faber, S. Woltran (ed.); (2016), 17 pages
• Counting Answer Sets via Dynamic Programming / J. Fichte, M. Hecher, M. Morak, S. Woltran / Talk: Workshop on Trends and Applications of Answer Set Programming, Klagenfurt, Austria; 2016-09-26; in: "Proceedings of the Workshop on Trends and Applications of Answer Set Programming (TAASP 2016)", T. Eiter, W. Faber, S. Woltran (ed.); (2016), 14 pages
• Dynamic Programming-based QBF Solving / G. Charwat, S. Woltran / Talk: 4th International Workshop on Quantified Boolean Formulas (QBF 2016), Bordeaux, France; 2016-07-04; in: "Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016)", F. Lonsing, M. Seidl (ed.); CEUR-WS.org, 1719 (2016), 14 pages
• Beyond IC Postulates: Classification Criteria for Merging Operators / A. Haret, A. Pfandler, S. Woltran / Talk: ECAI 2016 - 22nd European Conference on Artificial Intelligence, Den Haag, Niederlande; 2016-08-29 - 2016-09-02; in: "ECAI 2016 - 22nd European Conference on Artificial Intelligence", G. Kaminka, M. Fox, P. Bouquet, E. Hüllermeier, V. Dignum, F. Dignum, F. van Harmelen (ed.); IOS Press, 285 (2016), ISBN: 978-1-61499-671-2; 372 - 380
• On the functional completeness of argumentation semantics / M. Giacomin, T. Linsbichler, S. Woltran / Talk: 15th International Conference on Principles of Knowledge Representation and Reasoning (KR 2016), Kapstadt; 2016-04-25 - 2016-04-29; in: "Principles of Knowledge Representation and Reasoning: Proceedings of the 15th International Conference", C. Baral, J. Delgrande, F. Wolter (ed.); AAAI Press, (2016), 43 - 52
• Merging of Abstract Argumentation Frameworks / J. Delobelle, A. Haret, S. Konieczny, J. Mailly, J. Rossit, S. Woltran / Talk: 15th International Conference on Principles of Knowledge Representation and Reasoning (KR 2016), Kapstadt; 2016-04-25 - 2016-04-29; in: "Principles of Knowledge Representation and Reasoning: Proceedings of the 15th International Conference", C. Baral, J. Delgrande, F. Wolter (ed.); AAAI Press, (2016), 33 - 42
• Investigating the relationship between argumentation semantics via signature / P. Dunne, T. Linsbichler, C. Spanring, S. Woltran / Talk: Twenty-Fifth International Joint Conference on Artificial Intelligence - IJCAI 2016, New York, NY, USA; 2016-07-09 - 2016-07-15; in: "Proceedings of the 25th International Joint Conference on Artificial Intelligence", S. Kambhampati (ed.); IJCAI/AAAI Press, (2016), ISBN: 978-1-57735-770-4; 1051 - 1057
• Distributing Knowledge Into Simple Bases / A. Haret, J. Mailly, S. Woltran / Talk: Twenty-Fifth International Joint Conference on Artificial Intelligence - IJCAI 2016, New York, NY, USA; 2016-07-09 - 2016-07-15; in: "Proceedings of the 25th International Joint Conference on Artificial Intelligence", S. Kambhampati (ed.); IJCAI/AAAI Press, (2016), ISBN: 978-1-57735-770-4; 1109 - 1115
• Translation-Based Revision and Merging for Minimal Horn Reasoning / G. Brewka, J. Mailly, S. Woltran / Talk: ECAI 2016 - 22nd European Conference on Artificial Intelligence, Den Haag, Niederlande; 2016-08-29 - 2016-09-02; in: "Proceedings of the 22nd European Conference on Artificial Intelligence", G. Kaminka, M. Fox, P. Bouquet, E. Hüllermeier, V. Dignum, F. Dignum, F. van Harmelen (ed.); IOS Press, Frontiers in Artificial Intelligence and Applications 285 (2016), ISBN: 978-1-61499-671-2; 734 - 742
• Verifiability of argumentation semantics / R. Baumann, T. Linsbichler, S. Woltran / Talk: 6th International Conference on Computational Models of Argument (COMMA 2016), Potsdam; 2016-09-12 - 2016-09-16; in: "Computational Models of Argument - Proceedings of COMMA 2016", P. Baroni, Th. F. Gordon, T. Scheffler, M. Stede (ed.); IOS Press, Frontiers in Artificial Intelligence and Applications 287 (2016), ISBN: 978-1-61499-685-9; 83 - 94
• Investigating the relationship between argumentation semantics via signatures / P. Dunne, T. Linsbichler, C. Spanring, S. Woltran / Talk: 39th Annual German Conference on AI (KI 2016), Klagenfurt; 2016-09-26 - 2016-09-30; in: "Advances in Artificial Intelligence - 39th Annual German Conference on AI, Proceedings", G. Friedrich, M. Helmert, F. Wotawa (ed.); Springer, LNCS 9904 (2016), ISBN: 978-3-319-46072-7; 271 - 277
• On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions / B. Bliem, M. Hecher, S. Woltran / Talk: COMMA - International Conference on Computational Models of Argument, Potsdam, Germany; 2016-09-12 - 2016-09-16; in: "Computational Models of Argument", P. Baroni, Th. F. Gordon, T. Scheffler, M. Stede (ed.); IOS Press, Frontiers in Artificial Intelligence and Applications 287 (2016), ISBN: 978-1-61499-685-9; 107 - 118
• Complexity of Secure Sets / B. Bliem, S. Woltran / Talk: International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Garching, Germany; 2015-06-17 - 2015-06-19; in: "Proceedings of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015)", E. Mayr (ed.); LNCS/Springer, 9224 (2016), ISBN: 978-3-662-53173-0; 64 - 77
• Subset Minimization in Dynamic Programming on Tree Decompositions / B. Bliem, G. Charwat, M. Hecher, S. Woltran / Talk: AAAI-16 Workshop on Beyond NP, Phoenix, Arizona, USA; 2016-02-12; in: "Beyond NP, Papers from the 2016 AAAI Workshop", A. Darwiche (ed.); AAAI Press, WS-16-05 (2016), 300 - 306
• Equivalence between Answer-Set Programs under (Partially) Fixed Input / B. Bliem, S. Woltran / Talk: Foundations of Information and Knowledge Systems - 9th International Symposium - FoIKS 2016, Linz; 2016-03-07 - 2016-03-11; in: "Foundations of Information and Knowledge Systems - 9th International Symposium, FoIKS 2016, Linz, Austria, March 7-11, 2016. Proceedings", M. Gyssens, G. Simari (ed.); Lecture Notes in Computer Science (LNCS) / Springer, 9616 (2016), ISBN: 978-3-319-30023-8; 95 - 111
• ASP for Anytime Dynamic Programming on Tree Decompositions / B. Bliem, B. Kaufmann, T. Schaub, S. Woltran / Talk: Twenty-Fifth International Joint Conference on Artificial Intelligence - IJCAI 2016, New York, NY, USA; 2016-07-09 - 2016-07-15; in: "Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016", S. Kambhampati (ed.); IJCAI/AAAI Press, (2016), ISBN: 978-1-57735-770-4; 979 - 986
• Providing Built-In Counters in a Declarative Dynamic Programming Environment / M. Abseher, M. Moldovan, S. Woltran / Talk: Joint German/Austrian Conference on Artificial Intelligence, Klagenfurt, Austria; 2016-09-26 - 2016-09-30; in: "KI 2016: Advances in Artificial Intelligence", G. Friedrich, M. Helmert, F. Wotawa (ed.); LNCS/Springer, 9904 (2016), ISBN: 978-3-319-46072-7; 3 - 16
• Clique-Width and Directed Width Measures for Answer-Set Programming / B. Bliem, S. Ordyniak, S. Woltran / Talk: ECAI 2016 - 22nd European Conference on Artificial Intelligence, Den Haag, Niederlande; 2016-08-29 - 2016-09-02; in: "ECAI 2016 - 22nd European Conference on Artificial Intelligence", G. Kaminka, M. Fox, P. Bouquet, E. Hüllermeier, V. Dignum, F. Dignum, F. van Harmelen (ed.); IOS Press, 285 (2016), ISBN: 978-1-61499-671-2; 1105 - 1113
• ASP for Anytime Dynamic Programming on Tree Decompositions (Extended Abstract) / B. Bliem, B. Kaufmann, T. Schaub, S. Woltran / Talk: Annual German Conference on Artificial Intelligence (KI), Klagenfurt, Austria; 2016-09-26 - 2016-09-30; in: "KI 2016: Advances in Artificial Intelligence", G. Friedrich, M. Helmert, F. Wotawa (ed.); LNCS/Springer, 9904 (2016), ISBN: 978-3-319-46072-7; 257 - 263
• Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning / M. Abseher, N. Musliu, S. Woltran / Report No. DBAI-TR-2016-94, 2016; 41 pages
• BDD-based Dynamic Programming on Tree Decompositions / G. Charwat, S. Woltran / Report No. DBAI-TR-2016-95, DBAI, 2016; 47 pages
• htd -- A Free, Open-Source Framework for Tree Decompositions and Beyond / M. Abseher, N. Musliu, S. Woltran / Report No. DBAI-TR-2016-96, 2016; 52 pages
• Treewidth-Preserving Modeling in ASP / M. Bichler, B. Bliem, M. Moldovan, M. Morak, S. Woltran / Report No. DBAI-TR-2016-97, 2016; 37 pages
• Multiparametric View on Answer Set Programming / J. Fichte, M. Kronegger, S. Woltran / Report No. DBAI-TR-2016-99, 2016; 41 pages
• Answer Set Solving using Tree Decompositions and Dynamic Programming -- The DynASP2 System / J. Fichte, M. Hecher, M. Morak, S. Woltran / Report No. DBAI-TR-2016-101, 2016; 70 pages

2015

• Dynamic Programming on Tree Decomposition in Practice. Some Lessons Learned / S. Woltran / Keynote Lecture: 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2015), Timisoara (invited); 2015-09-21 - 2015-09-24
• A Glimpse on Gerhard Brewka's Contributions to Artificial Intelligence / T. Eiter, H. Strass, M. Truszczynski, S. Woltran / in: "Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation", T. Eiter, H. Strass, M. Truszczynski, S. Woltran (ed.); Springer LNCS, 2015, (invited), 1 - 16
• Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation -- Essays Dedicated to Gerhard Brewka on the Occasion of His 60th Birthday / T. Eiter, H. Strass, M. Truszczynski, S. Woltran / in series "Lecture Notes in Computer Science", series editor: R. Goebel, Y. Tanaka, W. Wahlster; Springer, 2015, ISBN: 978-3-319-14725-3, 359 pages
• Applications of logical approaches to argumentation / J. Leite, C. Tran, P. Torroni, S. Woltran / Argument & Computation, 6 (2015), 1; 1 - 2
• The complexity of handling minimal solutions in logic-based abduction / A. Pfandler, R. Pichler, S. Woltran / Journal of Logic and Computation, 25 (2015), 3; 805 - 825
• Computing Secure Sets in Graphs using Answer Set Programming / F. Dusberger, M. Abseher, B. Bliem, G. Charwat, S. Woltran / Journal of Logic and Computation, 2015 special issue (2015), 2015 special issue; 1 - 26
• Reasoning in Abstract Dialectical Frameworks using Quantified Boolean Formulas / M. Diller, J. P. Wallner, S. Woltran / Argument & Computation, 6 (2015), 2; 149 - 177
• Characteristics of multiple viewpoints in abstract argumentation / P. Dunne, W. Dvorak, T. Linsbichler, S. Woltran / Artificial Intelligence, 228 (2015), 153 - 178
• Dual-normal logic programs - the forgotten class / J. Fichte, M. Truszczynski, S. Woltran / Theory and Practice of Logic Programming, 15 (2015), 495 - 510
• Improved answer-set programming encodings for abstract argumentation / S. Gaggl, N. Manthey, A. Ronca, J. P. Wallner, S. Woltran / Theory and Practice of Logic Programming, 15 (2015), 4-5; 434 - 448
• Methods for solving reasoning problems in abstract argumentation - A survey / G. Charwat, W. Dvorak, S. Gaggl, J. P. Wallner, S. Woltran / Artificial Intelligence, 220 (2015), 28 - 63
• On the Functional Completeness of Argumentation Semantics / M. Giacomin, T. Linsbichler, S. Woltran / Talk: KI 2015 Workshop on Formal and Cognitive Reasoning, Dresden, Germany; 2015-09-22; in: "Proceedings of the 5th Workshop on Dynamics of Knowledge and Belief (DKB-2015) and the 4th Workshop KI & Kognition (KIK-2015)", C. Beierle, G. Kern-Isberner, M. Ragni, F. Stolzenburg (ed.); CEUR Workshop Proceedings, 1444 (2015), 12 pages
• Shift Design with Answer Set Programming / M. Abseher, M. Gebser, N. Musliu, T. Schaub, S. Woltran / Talk: 8th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2015, Cork, Ireland; 2015-08-31; in: "8th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2015", D. Inclezan, M. Maratea (ed.); (2015), 13 pages
• D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy / B. Bliem, G. Charwat, M. Hecher, S. Woltran / Talk: 8th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2015, Cork, Ireland; 2015-08-31; in: "8th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2015", D. Inclezan, M. Maratea (ed.); (2015), 15 pages
• On the Parameterized Complexity of Belief Revision / A. Pfandler, St. Rümmele, J. P. Wallner, S. Woltran / Talk: Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina; 2015-07-25 - 2015-07-31; in: "Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence - IJCAI 2015", Q. Yang, M. Wooldridge (ed.); AAAI Press, (2015), ISBN: 978-1-57735-738-4; 3149 - 3155
• Abstract Solvers for Dung's Argumentation Frameworks / R. Brochenin, T. Linsbichler, M. Maratea, J. Wallner, S. Woltran / Talk: The 2015 International Workshop on Theory and Applications of Formal Argument, Buenos Aires, Argentinien; 2015-07-25 - 2015-07-26; in: "Theory and Applications of Formal Argumentation", E. Black, S. Modgil, N. Oren (ed.); Lecture Notes in Computer Science, 9524 (2015), ISBN: 978-3-319-28459-0; 40 - 58
• The Hidden Power of Abstract Argumentation Semantics / T. Linsbichler, C. Spanring, S. Woltran / Talk: The 2015 International Workshop on Theory and Applications of Formal Argument, Buenos Aires, Argentinien; 2015-07-25 - 2015-07-26; in: "Theory and Applications of Formal Argumentation", E. Black, S. Modgil, N. Oren (ed.); Lecture Notes in Computer Science, 9524 (2015), ISBN: 978-3-319-28459-0; 146 - 162
• Merging in the Horn Fragment / A. Haret, St. Rümmele, S. Woltran / Talk: Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina; 2015-07-25 - 2015-07-31; in: "Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence - IJCAI 2015", Q. Yang, M. Wooldridge (ed.); AAAI Press, (2015), ISBN: 978-1-57735-738-4; 3041 - 3047
• An extension-based approach to belief revision in abstract argumentation / M. Diller, A. Haret, T. Linsbichler, St. Rümmele, S. Woltran / Talk: Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina; 2015-07-25 - 2015-07-31; in: "Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence - IJCAI 2015", Q. Yang, M. Wooldridge (ed.); AAAI Press, (2015), ISBN: 978-1-57735-738-4; 2926 - 2932
• Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract) / W. Dvorak, M. Järvisalo, J. Wallner, S. Woltran / Talk: International Joint Conference on Artificial Intelligence (IJCAI), Buenos Aires, Argentinien; 2015-07-25 - 2015-07-31; in: "Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015", (2015), 4173 - 4177
• Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning / F. Dusberger, M. Abseher, N. Musliu, S. Woltran / Talk: Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina; 2015-07-25 - 2015-07-31; in: "Proceedings of IJCAI 2015, the 24th International Joint Conference on Artificial Intelligence", Q. Yang, M. Wooldridge (ed.); AAAI Press, (2015), ISBN: 978-1-57735-738-4; 275 - 282
• Shift Design with Answer Set Programming / M. Abseher, M. Gebser, N. Musliu, T. Schaub, S. Woltran / Talk: 13th International Conference on Logic Programming and Non-monotonic Reasoning, LPNMR 2015, Lexington, Kentucky, USA; 2015-09-27 - 2015-09-30; in: "Logic Programming and Nonmonotonic Reasoning, 13th International Conference, LPNMR 2015, Lexington, KY, USA, September 27-30, 2015, Proceedings", F. Calimeri, G. Ianni, M. Truszczynski (ed.); Springer, Lecture Notes in Computer Science Volume 9345 (2015), ISBN: 978-3-319-23263-8; 32 - 39
• Efficient Problem Solving on Tree Decompositions using Binary Decision Diagrams / G. Charwat, S. Woltran / Talk: 13th International Conference on Logic Programming and Non-monotonic Reasoning, LPNMR 2015, Lexington, Kentucky, USA; 2015-09-27 - 2015-09-30; in: "Logic Programming and Nonmonotonic Reasoning, 13th International Conference, LPNMR 2015, Lexington, KY, USA, September 27-30, 2015, Proceedings", F. Calimeri, G. Ianni, M. Truszczynski (ed.); Springer, Lecture Notes in Computer Science Volume 9345 (2015), ISBN: 978-3-319-23263-8; 213 - 227
• Characteristics of Multiple Viewpoints in Abstract Argumentation / P. Dunne, W. Dvorak, T. Linsbichler, S. Woltran / Report No. DBAI-TR-2015-89, 2015; 42 pages
• D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy / B. Bliem, G. Charwat, M. Hecher, S. Woltran / Report for TU Wien; Report No. DBAI-TR-2015-93, 2015; 38 pages

2014

• Comparing the Power of Different Semantics for Abstract Argumentation / S. Woltran / Talk: Workshop on the Dynamics of Argumentation, Rules and Conditionals DARC, Luxemburg (invited); 2014-10-24
• Graph Structures for Knowledge Representation and Reasoning - Third International Workshop, GKR 2013, Beijing, China, August 3, 2013. Revised Selected Papers / M. Croitoru, S. Rudolph, S. Woltran, C. Gonzales / Springer, 2014, ISBN: 978-3-319-04533-7; 210 pages
• Tractable answer-set programming with weight constraints: bounded treewidth is not enough / R. Pichler, St. Rümmele, St. Szeider, S. Woltran / Theory and Practice of Logic Programming, 14 (2014), 2; 141 - 164
• Belief revision within fragments of propositional logic / N. Creignou, O. Papini, R. Pichler, S. Woltran / Journal of Computer and System Sciences, 80 (2014), 2; 427 - 449
• Generalizations of Dung Frameworks and Their Role in Formal Argumentation / G. Brewka, S. Polberg, S. Woltran / IEEE Intelligent Systems, 29 (2014), 1; 30 - 38
• Complexity of super-coherence problems in ASP / M. Alviano, W. Faber, S. Woltran / Theory and Practice of Logic Programming, 14 (2014), 3; 339 - 361
• Complexity-Sensitive Decision Procedures for Abstract Argumentation / W. Dvorak, M. Järvisalo, J. P. Wallner, S. Woltran / Artificial Intelligence, 206 (2014), 53 - 78
• An Introduction to Abstract Argumentation / S. Woltran / Keynote Lecture: 6th USENIX Workshop on the Theory and Practice of Provenance, Köln (invited); 2014-06-12 - 2014-06-13; in: "Proceedings 6th USENIX Workshop on the Theory and Practice of Provenance", A. Chapman, B. Ludaescher, A. Schreiber (ed.); (2014)
• Abstract Argumentation - All Problems Solved? / S. Woltran / Keynote Lecture: European Conference on Artificial Intelligence (ECAI), Prag, Tschechisch Republik (invited); 2014-08-18 - 2014-08-22; in: "Proceedings ECAI 2014", T. Schaub (ed.); IOS Press, 263 (2014), ISBN: 978-1-61499-418-3
• Belief merging within fragments of propositional logic / N. Creignou, O. Papini, St. Rümmele, S. Woltran / Talk: 15th International Workshop on Non-Monotonic Reasoning (NMR 2014), Vienna; 2014-07-17 - 2014-07-19; in: "Proceedings of the 15th International Workshop on Non-Monotonic Reasoning", (2014), 10 pages
• Compact Argumentation Frameworks / R. Baumann, W. Dvorak, T. Linsbichler, H. Strass, S. Woltran / Talk: International Workshop on Non-Monotonic Reasoning (NMR), Wien; 2014-07-17 - 2014-07-19; in: "15th International Workshop on Non-monotonic Reasoning (NMR 2014)", S. Konieczny, H. Tompits (ed.); (2014), 10 pages
• Compact Argumentation Frameworks / R. Baumann, W. Dvorak, T. Linsbichler, H. Strass, S. Woltran / Talk: ECAI 2014, Prag; 2014-08-18 - 2014-08-22; in: "Proceedings of the 21st European Conference on Artificial Intelligence", (2014), ISBN: 978-1-61499-418-3; 69 - 74
• Computing Secure Sets in Graphs using Answer Set Programming. / M. Abseher, B. Bliem, G. Charwat, F. Dusberger, S. Woltran / Talk: ASPOCP 2014 - 7th Workshop on Answer Set Programming and Other Computing Paradigms, Wien; 2014-07-23; in: "7th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2014", (2014)
• GRAPPA: A Semantical Framework for Graph-Based Argument Processing / G. Brewka, S. Woltran / Talk: ECAI 2014, Prag; 2014-08-18 - 2014-08-22; in: "Proceedings of 21st European Conference on Artificial Intelligence", (2014), ISBN: 978-1-61499-418-3; 153 - 158
• Belief merging within fragments of propositional logic / N. Creignou, O. Papini, St. Rümmele, S. Woltran / Talk: ECAI 2014, Prag; 2014-08-18 - 2014-08-22; in: "Proceedings of the 21st European Conference on Artificial Intelligence", (2014), ISBN: 978-1-61499-418-3; 231 - 236
• Probabilistic Argumentation Frameworks - A Logical Approach / D. Doder, S. Woltran / Talk: International Conference on Scalable Uncertainty Management (SUM), Oxford; 2014-09-15 - 2014-09-17; in: "Scalable Uncertainty Management", U. Straccia, A. Cali (ed.); Springer, 8720 (2014), ISBN: 978-3-319-11507-8; 134 - 147
• Resolution-Based Grounded Semantics Revisited / W. Dvorak, T. Linsbichler, E. Oikarinen, S. Woltran / Talk: COMMA - International Conference on Computational Models of Argument, Pitlochry; 2014-09-09 - 2014-09-12; in: "Computational Models of Argument", S. Parsons, N. Oren, Ch. Reed, F. Cerutti (ed.); IOS Press, 266 (2014), ISBN: 978-1-61499-436-7; 269 - 280
• Characteristics of Multiple Viewpoints in Abstract Argumentation / P. Dunne, W. Dvorak, T. Linsbichler, S. Woltran / Talk: Principles of Knowledge Representation and Reasoning (KR), Wien; 2014-07-20 - 2014-07-24; in: "Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference", C. Baral, G. De Giacomo, T. Eiter (ed.); AAAI Press, (2014), ISBN: 978-1-57735-657-8; 72 - 81
• The D-FLAT System for Dynamic Programming on Tree Decompositions. / M. Abseher, B. Bliem, G. Charwat, F. Dusberger, M. Hecher, S. Woltran / Talk: European Conference on Logics in Artificial Intelligence (JELIA), Madeira; 2014-09-24 - 2014-09-26; in: "Logics in Artificial Intelligence - 14th European Conference, JELIA 2014", E. Fermé, J. Leite (ed.); Springer, (2014), ISSN: 0302-9743; 558 - 572
• Reasoning in Abstract Dialectical Frameworks Using Quantified Boolean Formulas / M. Diller, J. P. Wallner, S. Woltran / Talk: COMMA - International Conference on Computational Models of Argument, Pitlochry, Scotland, United Kingdom; 2014-09-09 - 2014-09-12; in: "Computational Models of Argument", IOS Press, 266 (2014), ISSN: 1879-8314; 241 - 252
• D-FLAT: Progress Report / M. Abseher, B. Bliem, G. Charwat, F. Dusberger, M. Hecher, S. Woltran / Report for TU Wien, Institut fuer Informationssysteme; Report No. DBAI-TR-2014-86, 2014; 57 pages

2013

• Characteristics of Multiple Viewpoints in Abstract Argumentation / P. Dunne, W. Dvorak, T. Linsbichler, S. Woltran / Talk: 4th Workshop on Dynamics of Knowledge and Belief (DKB-2013), Koblenz, Germany; 2013-09-16 - 2013-09-20
• Applicability of ASP-based Problem Solving on Tree Decompositions / B. Bliem, R. Pichler, S. Woltran / Talk: Third International Workshop on Graph Structures for Knowledge Representation and Reasoning (GKR) 2013, Peking; 2013-08-03 - 2013-08-05
• On the Limits of Expressiveness in Abstract Argumentation Semantics / S. Woltran / Talk: Belief Change and Argumentation in Multi-Agent Scenarios, Dagstuhl, Germany (invited); 2013-06-02 - 2013-06-07
• Computational Logic in Multi-Agent Systems / J. Leite, T. Son, P. Torroni, L. van der Torre, S. Woltran / Springer, 2013, ISBN: 978-3-642-40623-2
• Strong Equivalence of Qualitative Optimization Problems / W. Faber, M. Truszczynski, S. Woltran / Journal of Artificial Intelligence Research, 47 (2013), 351 - 391
• The cf2 argumentation semantics revisited. / S. Gaggl, S. Woltran / Journal of Logic and Computation, 23 (2013), 5; 925 - 949
• Parametric Properties of Ideal Semantics / P. Dunne, W. Dvorak, S. Woltran / Artificial Intelligence, 202 (2013), 1; 1 - 28
• Complexity of redundancy detection on RDF graphs in the presence of rules, constraints, and queries / R. Pichler, A. Polleres, S. Skritek, S. Woltran / Semantic Web (invited), 4 (2013), 4; 351 - 393
• A Model-Theoretic Approach to Belief Change in Answer Set Programming / J. Delgrande, T. Schaub, H. Tompits, S. Woltran / ACM Transactions on Computational Logic, 14 (2013), 2
• Model-Based Recasting in Answer-Set Programming / T. Eiter, M. Fink, J. Puehrer, H. Tompits, S. Woltran / Journal of Applied Non-Classical Logics (JANCL), 23 (2013), 1-2; 75 - 104
• Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems / W. Dvorak, S. Gaggl, J. P. Wallner, S. Woltran / in: "Applications of Declarative Programming and Knowledge Management", H. Tompits, S. Abreu, J. Oetsch, J. Puehrer, D. Seipel, M. Umeda, A. Wolf (ed.); Springer, 2013, ISBN: 978-3-642-41523-4, 114 - 133
• Abstract Preference Frameworks - a Unifying Perspective on Separability and Strong Equivalence / W. Faber, M. Truszczynski, S. Woltran / in: "Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence", AAAI Press, 2013, ISBN: 978-1-57735-615-8, 297 - 303
• Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? / N. Creignou, R. Pichler, S. Woltran / in: "Proceedings of the 23rd International Joint Conference on Artificial Intelligence", F. Rossi (ed.); AAAI Press, 2013, ISBN: 978-1-57735-633-2, 954 - 961
• Abstract Dialectical Frameworks Revisited / G. Brewka, St. Ellmauthaler, H. Strass, J. P. Wallner, S. Woltran / Poster: Twenty-third International Conference on Artificial Intelligence, Beijing, China; 2013-08-03 - 2013-08-09; in: "Proceedings of the twenty-third International Joint Conference on Artificial Intelligence (IJCAI 2013)", F. Rossi (ed.); AAAI Press, (2013), ISBN: 978-1-57735-633-2; 803 - 809
• Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem / B. Bliem, R. Pichler, S. Woltran / Talk: International Symposium on Parameterized and Exact Computation (IPEC), Sophia Antipolis; 2013-09-04 - 2013-09-06; in: "Parameterized and Exact Computation", G. Gutin, St. Szeider (ed.); Springer, 8246 (2013), ISBN: 978-3-319-03897-1; 28 - 40
• Structural Properties for Deductive Argument Systems / A. Hunter, S. Woltran / Talk: The 12th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, Utrecht, The Netherlands; 2013-08-08 - 2013-08-10; in: "Symbolic and Quantitative Approaches to Reasoning with Uncertainty", L. van der Gaag (ed.); Springer, 7958 (2013), ISBN: 978-3-642-39090-6; 278 - 289
• Admissibility in the Abstract Dialectical Framework / S. Polberg, J. P. Wallner, S. Woltran / Talk: 14th International Workshop on Computational Logic in Multi-Agent Systems, Corunna, Spain; 2013-09-16 - 2013-09-18; in: "Computational Logic in Multi-Agent Systems", J. Leite, T. Son, P. Torroni, L. van der Torre, S. Woltran (ed.); Springer, 8143 (2013), ISBN: 978-3-642-40623-2; 102 - 118
• ARVis: Visualizing Relations between Answer Sets / T. Ambroz, G. Charwat, A. Jusits, J. P. Wallner, S. Woltran / Talk: 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013), Corunna, Spain; 2013-09-15 - 2013-09-19; in: "Logic Programming and Nonmonotonic Reasoning", P. Cabalar, T. Son (ed.); Springer, 8143 (2013), ISBN: 978-3-642-40563-1; 73 - 78
• AGM-Style Belief Revision of Logic Programs under Answer Set Semantics / J. Delgrande, P. Peppas, S. Woltran / Talk: 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013), Corunna, Spain; 2013-09-15 - 2013-09-19; in: "12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013)", P. Cabalar, T. Son (ed.); Springer, Heidelberg (2013), ISBN: 978-3-642-40563-1; 264 - 276
• Advanced SAT Techniques for Abstract Argumentation / J. P. Wallner, G. Weissenbacher, S. Woltran / Talk: International Workshop on Computational Logic in Multi-Agent Systems (CLIMA), Corunna, Spanien; 2013-09-16 - 2013-09-18; in: "CLIMA", Springer / LNCS, 8143 (2013), ISBN: 978-3-642-40623-2; 138 - 154
• Model-Based Recasting in Answer-Set Programming / T. Eiter, M. Fink, J. Puehrer, H. Tompits, S. Woltran / Report for TU Wien, Institut fuer Informationssysteme; Report No. DBAI-TR-2013-83, 2013; 34 pages

2012

• Characteristics of Argumentation Semantics / S. Woltran / Talk: Logique à Marseille -- Camilla Schwind à l'honneur, Marseille (invited); 2012-12-08
• CEGARTIX: A SAT-Based Argumentation System / W. Dvorak, M. Järvisalo, J. P. Wallner, S. Woltran / Talk: Theory and Application of Satisfiability Testing -- SAT, Trento, Italy; 2012-06-17 - 2012-06-20
• The Added Value of Argumentation / S. Modgil, F. Toni, F. Bex, I. Bratko, C. I. Chesnevar, W. Dvorak, M. A. Falappa, X. Fan, S. Gaggl, A. J. Garcia, M. P. Gonzalez, Th. F. Gordon, J. Leite, M. Mozina, Ch. Reed, G. Simari, St. Szeider, P. Torroni, S. Woltran / in: "Agreement Technologies", S. Ossowski (ed.); Springer Netherlands, Dordrecht, 2012, ISBN: 978-94-007-5582-6, 357 - 403
• Parameterized Splitting: A Simple Modification-Based Approach / R. Baumann, G. Brewka, W. Dvorak, S. Woltran / in: "Correct Reasoning Correct Reasoning Correct Reasoning Essays on Logic-Based AI in Honour of Vladimir Lifschitz", E. Erdem, J. Lee, Y. Lierler, D. Pearce (ed.); issued by: Springer; Springer LNCS, Springer, 2012, ISBN: 978-3-642-30742-3, 57 - 71
• Fourth International Conference on Computational Models of Argument (COMMA 2012) / B. Verheij, St. Szeider, S. Woltran / in series "Computational Models of Argument", series editor: J. Breuker, N. Guarino, J. Liu, R. de Mántaras, R. Mizoguchi, M. Musen, S. Pal, N. Zhong; IOS Press, Amsterdam, 2012, ISBN: 1614991103
• Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough / R. Pichler, St. Rümmele, St. Szeider, S. Woltran / Theory and Practice of Logic Programming, FirstView Article (2012), July; 1 - 24
• D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming / B. Bliem, M. Morak, S. Woltran / Theory and Practice of Logic Programming, 12 (2012), 4-5; 445 - 464
• Towards fixed-parameter tractable algorithms for abstract argumentation / W. Dvorak, R. Pichler, S. Woltran / Artificial Intelligence, 186 (2012), 186; 1 - 37
• Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough / R. Pichler, St. Rümmele, St. Szeider, S. Woltran / CoRR - Computing Research Repository, 1204.3040 (2012), abs/1204.3040; 20 pages
• Utilizing ASP for Generating and Visualizing Argumentation Frameworks / G. Charwat, J. P. Wallner, S. Woltran / Talk: 5th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2012), Budapest, Ungarn; 2012-09-04; in: "5th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2012)", M. Fink, Y. Lierler (ed.); CoRR, (2012), 15 pages
• Belief Revision within Fragments of Propositional Logic / N. Creignou, O. Papini, R. Pichler, S. Woltran / Talk: Principles of Knowledge Representation and Reasoning (KR), Rome, Italy; 2012-06-10 - 2012-06-13; in: "Proceedings of 13th int. conf. on Principles of Knowledge Representation and Reasoning", G. Brewka, T. Eiter, S. McIlraith (ed.); AAAI Press, (2012), ISBN: 978-1-57735-561-8; 11 pages
• Multicut on Graphs of Bounded Clique-width / M. Lackner, R. Pichler, St. Rümmele, S. Woltran / Talk: Annual International Conference on Combinatiorial Optimization and Applications (COCOA), Banff, Canada; 2012-08-05 - 2012-08-09; in: "Lecture Notes of Computer Science", G. Lin (ed.); Springer, 7402 (2012), ISBN: 978-3-642-31769-9; 115 - 126
• Abstract Argumentation via Monadic Second Order Logic / W. Dvorak, St. Szeider, S. Woltran / Talk: International Conference on Scalable Uncertainty Management (SUM), Marburg, Germany; 2012-09-17 - 2012-09-19; in: "Proceedings of Sixth International Conference on Scalable Uncertainty Management (SUM 2012)", E. Hüllermeier, S. Link, T. Fober, B. Seeger (ed.); Lecture Notes in Computer Science / Springer, 7520 (2012), ISBN: 978-3-642-33361-3; 85 - 98
• Preprocessing of Complex Non-Ground Rules in Answer Set Programming / M. Morak, S. Woltran / Talk: International Conference on Logic Programming (ICLP), Budapest, Ungarn; 2012-09-04 - 2012-09-08; in: "Technical Communications of the 28th International Conference on Logic Programming", A. Dovier, Vitor Costa (ed.); LIPIcs, 17 (2012), ISBN: 978-3-939897-43-9; 247 - 258
• Strong Equivalence of Qualitative Optimization Problems / W. Faber, M. Truszczynski, S. Woltran / Talk: Principles of Knowledge Representation and Reasoning (KR), Rome, Italy; 2012-06-10 - 2012-06-14; in: "Proceedings of 13th int. conf. on Principles of Knowledge Representation and Reasoning", G. Brewka, T. Eiter, S. McIlraith (ed.); AAAI Press, (2012), ISBN: 978-1-57735-560-1; 188 - 198
• Complexity-Sensitive Decision Procedures for Abstract Argumentation / W. Dvorak, M. Järvisalo, J. P. Wallner, S. Woltran / Talk: Principles of Knowledge Representation and Reasoning (KR), Rome, Italy; 2012-06-10 - 2012-06-14; in: "Proceedings of 13th int. conf. of Principles of Knowledge Representation and Reasoning", G. Brewka, T. Eiter, S. McIlraith (ed.); AAAI Press, (2012), ISBN: 978-1-57735-560-1; 54 - 64
• Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming / M. Morak, N. Musliu, R. Pichler, St. Rümmele, S. Woltran / Talk: Learning and Intelligent OptimizatioN Conference LION, Paris, Frankreich; 2012-01-16 - 2012-01-20; in: "Lecture Notes in Computer Science", Y. Hamadi, M. Schoenauer (ed.); Springer, 7219 (2012), ISBN: 978-3-642-34412-1; 130 - 144
• The cf2 Argumentation Semantics Revisited. / S. Gaggl, S. Woltran / Report No. DBAI-TR-2012-77, 2012; 28 pages
• Abstract Argumentation via Monadic Second Order Logic. / W. Dvorak, St. Szeider, S. Woltran / Report No. DBAI-TR-2012-79, 2012; 21 pages

2011

• Complexity of Super-Coherence Problems in ASP / M. Alviano, W. Faber, S. Woltran / Talk: Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP) 2010, Lexington, Kentucky, USA; 2011-07-06 - 2011-07-10
• Strong Equivalence in Argumentation / S. Woltran / Talk: Universität Leipzig, Leipzig, Deutschland; 2011-06-22
• Computational Aspects of Formal Argumentation / S. Woltran / Talk: TU Dresden, Dresden, Deutschland; 2011-03-25
• Manifold Answer-Set Programs and Their Applications / W. Faber, S. Woltran / in: "Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning", M. Balduccini, T. Son (ed.); Springer-Verlag, Berlin Heidelberg, 2011, ISBN: 978-3-642-20831-7, 44 - 63
• Complexity of logic-based argumentation in Post's framework / N. Creignou, J. Schmidt, M. Thomas, S. Woltran / Argument & Computation, 2 (2011), 2-3; 107 - 129
• On the Intertranslatability of Argumentation Semantics / W. Dvorak, S. Woltran / Journal of Artificial Intelligence Research, 41 (2011), 445 - 475
• Special issue on answer set programming / M. Balduccini, S. Woltran / AI Communications, 24 (2011), 2; 105 - 106
• Characterizing strong equivalence for argumentation frameworks / E. Oikarinen, S. Woltran / Artificial Intelligence, 175 (2011), 14-15; 1985 - 2009
• Equivalence between Extended Datalog Programs. A Brief Survey / S. Woltran / in: "Datalog Reloaded", O. de Moor, G. Gottlob, T. Furche, A. Sellers (ed.); Springer, 2011, ISBN: 978-3-642-24205-2, 106 - 119
• A New Tree-Decomposition Based Algorithm for Answer Set Programming / M. Morak, N. Musliu, R. Pichler, St. Rümmele, S. Woltran / Poster: 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence, Boca Raton, Florida USA; 2011-11-07 - 2011-11-09; in: "2011 IEEE 23rd International Conference on Tools with Artificial Intelligence", T. M. Khoshgoftaar, X. Zhu (ed.); (2011), ISSN: 1082-3409; 916 - 918
• Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems. / W. Dvorak, S. Gaggl, J. P. Wallner, S. Woltran / Talk: International Conference on Applications of Declarative Programming and Knowledge Management, Vienna, Austria; 2011-09-28 - 2011-09-30; in: "19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011)", (2011), 14 pages
• A Dynamic Programming Reasoner for Abstract Argumentation. / W. Dvorak, M. Morak, C. Nopp, S. Woltran / Talk: International Conference on Applications of Declarative Programming and Knowledge Management, Vienna, Austria; 2011-09-28 - 2011-09-30; in: "19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011)", (2011), 5 pages
• Relating the Semantics of Abstract Dialectical Frameworks and Standard AFs / G. Brewka, P. Dunne, S. Woltran / Talk: International Joint Conference on Artificial Intelligence (IJCAI), Barcelon, Spain; 2011-07-16 - 2011-07-22; in: "Proceedings of the 22nd Int. Joint Conference on Artificial Intelligence", T. Walsh (ed.); AAAI Press, (2011), ISBN: 978-1-57735-516-8; Paper ID 137, 6 pages
• Parametric Properties of Ideal Semantics / W. Dvorak, P. Dunne, S. Woltran / Talk: International Joint Conference on Artificial Intelligence (IJCAI), Barcelona, Catalonia, Spain; 2011-07-16 - 2011-07-22; in: "Proceedings of the 22nd Int. Joint Conference on Artificial Intelligence", T. Walsh (ed.); AAAI Press, (2011), ISBN: 978-1-57735-516-8; Paper ID 148, 6 pages
• Strong Equivalence for Argumentation Semantics based on Conflict-free Sets / S. Gaggl, S. Woltran / Talk: European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU), Belfast, Northern Ireland; 2011-06-29 - 2011-07-01; in: "Lecture Notes in Artificial Intelligence", W. Liu (ed.); Springer, 6717 (2011), ISSN: 0302-9743; 38 - 49
• Towards Fixed-Parameter Tractable Algorithms for Abstract Argumentation / W. Dvorak, R. Pichler, S. Woltran / Report for TU Wien, Institut für Informationssysteme; Report No. DBAI-TR-2011-74, 2011; 55 pages
• Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming / M. Morak, N. Musliu, R. Pichler, St. Rümmele, S. Woltran / Report No. DBAI-TR-2011-73, 2011; 19 pages
• Preprocessing of Complex Non-Ground Rules in Answer Set Programming / M. Morak, S. Woltran / Report No. DBAI-TR-2011-72, 2011; 14 pages
• Strong Equivalence for Argumentation Semantics based on Conflict-free Sets / S. Gaggl, S. Woltran / Report for TU Wien, Institut für Informationssysteme; Report No. DBAI-TR-2011-68, 2011; 19 pages
• Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems / W. Dvorak, S. Gaggl, J. P. Wallner, S. Woltran / Report for TU Wien, Institut für Informationssysteme; Report No. DBAI-TR-2011-70, 2011; 32 pages

2010

• Computational Aspects of Abstract Argumentation / S. Woltran / Talk: Helsinki Graduate School in Computer Science and Engineering, Helsinki (invited); 2010-09-15 - 2010-09-16
• Deciding Equivalence between Extended Datalog Programs. A Brief Survey / S. Woltran / Talk: Datalog 2.0 Workshop, Oxford (invited); 2010-03-15 - 2010-03-19
• Answer-Set Programming Encodings for Argumentation Frameworks / U. Egly, S. Gaggl, S. Woltran / Argument & Computation, 1 (2010), 2; 147 - 177
• Complexity of semi-stable and stage semantics in argumentation frameworks / W. Dvorak, S. Woltran / Information Processing Letters, Inf. Process. Lett. 110 (2010), 11; 425 - 430
• Decentralized Diagnosis: Complexity Analysis and Datalog Encodings / A. Pfandler, R. Pichler, S. Woltran / Poster: Junior Scientist Conference 2010, Vienna; 2010-04-07 - 2010-04-09; in: "Proceedings of the Junior Scientist Conference 2010", H. Kaiser, R. Kirner (ed.); (2010), ISBN: 978-3-200-01797-9; 291 - 292
• On the Intertranslatability of Argumentation Semantics / W. Dvorak, S. Woltran / Talk: NonMon@30 - Thirty Years of Nonmonotonic Reasoning, Lexington, Kentucky, USA; 2010-10-22 - 2010-10-25; in: "Proceedings of the Conference on Thirty Years of Nonmonotonic Reasoning", (2010), 15 pages
• Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough / R. Pichler, St. Rümmele, St. Szeider, S. Woltran / Talk: Principles of Knowledge Representation and Reasoning (KR), Toronto, Kanda; 2010-05-09 - 2010-05-13; in: "Proc. of KR 2010", F. Lin, U. Sattler, M. Truszczynski (ed.); AAAI Press, (2010), ISBN: 978-1-57735-452-9; Paper ID 71, 10 pages
• Towards Fixed-Parameter Tractable Algorithms for Argumentation / W. Dvorak, R. Pichler, S. Woltran / Talk: Principles of Knowledge Representation and Reasoning (KR), Toronto, Kanda; 2010-05-09 - 2010-05-13; in: "Proc. of KR 2010", F. Lin, U. Sattler, M. Truszczynski (ed.); AAAI Press, (2010), ISBN: 978-1-57735-452-9; Paper ID 24, 11 pages
• Characterizing Strong Equivalence for Argumentation Frameworks / E. Oikarinen, S. Woltran / Talk: Principles of Knowledge Representation and Reasoning (KR), Toronto, Kanda; 2010-05-09 - 2010-05-13; in: "Proc. of KR 2010", F. Lin, U. Sattler, M. Truszczynski (ed.); AAAI Press, (2010), ISBN: 978-1-57735-452-9; Paper ID 25, 11 pages
• Abstract Dialectical Frameworks / G. Brewka, S. Woltran / Talk: Principles of Knowledge Representation and Reasoning (KR), Toronto, Kanda; 2010-05-09 - 2010-05-13; in: "Proc. of KR 2010", F. Lin, U. Sattler, M. Truszczynski (ed.); AAAI Press, (2010), ISBN: 978-1-57735-452-9; Paper ID 23, 10 pages
• The Complexity of Handling Minimal Solutions in Logic-Based Abduction / R. Pichler, S. Woltran / Talk: ECAI 2010 - 19th European Conference on Artificial Intelligence, Lisbon, Portugal; 2010-08-16 - 2010-08-20; in: "Prooceedings of ECAI 2010 - 19th European Conference on Artificial Intelligence", H. Coelho, R. Studer, M. Woolridge (ed.); IOS Press, 215 (2010), ISBN: 978-1-60750-605-8; 895 - 900
• Sets of Boolean Connectives That Make Argumentation Easier / N. Creignou, J. Schmidt, M. Thomas, S. Woltran / Talk: 12th European Conference on Logics in Artificial Intelligence (JELIA 2010), Helsinki, Finland; 2010-09-13 - 2010-09-15; in: "Logics in Artificial Intelligence", T. Janhunen, I. Niemelä (ed.); Springer, 6341 (2010), ISBN: 978-3-642-15674-8; 117 - 129
• Strong Equivalence in Argumentation / S. Woltran / Talk: CLIMA XI - 11th International Workshop on Computational Logis in Multi-Agent Systems, Lisbon, Portugal (invited); 2010-08-16 - 2010-08-17; in: "Computational Logic in Multi-Agent Systems, 11th International Workshop, CLIMA", J. Dix, J. Leite, G. Governatori, W. Jamroga (ed.); Lecture Notes/ Springer, 6245 (2010), ISBN: 978-3-642-14976-4; 14
• Representing Preferences Among Sets / G. Brewka, M. Truszczynski, S. Woltran / Talk: Twenty-Fourth AAAI Conference on Artificial Intelligence, Atlanta, Georgia, USA; 2010-07-11 - 2010-07-15; in: "Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010", M. Fox, D. Poole (ed.); AAAI Press, (2010)
• Counting and Enumeration Problems with Bounded Treewidth / R. Pichler, St. Rümmele, S. Woltran / Talk: Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), Dakar, Senegal; 2010-04-25 - 2010-05-01; in: "Lecture Notes in Artificial Intelligence 6355", R. Goebel, J. Siekmann, W. Wahlster (ed.); Lecture Notes in Computer Science, 6355 (2010), ISBN: 978-3-642-17510-7; 387 - 404
• A Dynamic-Programming Based ASP-Solver / M. Morak, R. Pichler, St. Rümmele, S. Woltran / Talk: 12th European Conference on Logics in Artificial Intelligence (JELIA 2010), Helsinki, Finland; 2010-09-13 - 2010-09-15; in: "Lecture Notes in Artificial Intelligence", R. Goebel, J. Siekmann, W. Wahlster (ed.); Springer, 6341 (2010), ISBN: 978-3-642-15674-8; 369 - 372
• Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries / R. Pichler, A. Polleres, S. Skritek, S. Woltran / Talk: RR 2010 - The fourth international Conference on Web Reasoning and Rule Systems, Brixen, Italy; 2010-09-22 - 2010-09-24; in: "RR 2010", P. Hitzler, T. Lukasiewicz (ed.); Lecture Notes/ Springer, 6333 (2010), ISBN: 978-3-642-15917-6; 133 - 148
• Reasoning in Argumentation Frameworks of Bounded Clique-Width / W. Dvorak, St. Szeider, S. Woltran / Talk: COMMA - International Conference on Computational Models of Argument, Desenzano del Garda, Italy; 2010-09-08 - 2010-09-10; in: "Proceedings of COMMA 2010", P. Baroni, F. Cerutti, M. Giacomin, G. Simari (ed.); IOS Press, Frontiers in Artificial Intelligence and Applications 216 (2010), ISBN: 978-1-60750-618-8; 219 - 230
• Minimising RDF Graphs under Rules and Constraints Revisited / R. Pichler, A. Polleres, S. Skritek, S. Woltran / Talk: 4th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2010), Bueons Aires, Argentina; 2010-05-17 - 2010-05-20; in: "Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management", A. H. F. Laender, L. V. S. Lakshmanan (ed.); CEUR Workshop Proceedings, 619 (2010), ISSN: 1613-0073
• cf2 Semantics Revisited / S. Gaggl, S. Woltran / Talk: COMMA - International Conference on Computational Models of Argument, Italien, Desenzano del Garda; 2010-09-08 - 2010-09-10; in: "Computational Models of Argument", P. Baroni, F. Cerutti, M. Giacomin, G. Simari (ed.); IOS Press, Frontiers in Artificial Intelligence and Applications/216/Niederlande (2010), ISBN: 9781607506188; 243 - 254
• Multicut Algorithms via Tree Decompositions / R. Pichler, St. Rümmele, S. Woltran / Talk: 7#{th}^Int. Conference on Algorithms and Complexity - CIAC 2010, Rome, Italy; 2010-05-26 - 2010-05-28; in: "Algorithms and Complexity", T. Calamoneri, J. Diaz (ed.); LNCS, Springer, 6078 (2010), ISBN: 978-3-642-13072-4; 167 - 179

2009

• Characterizing Strong Equivalence for Argumentation Frameworks / S. Woltran / Keynote Lecture: Argumentation Christmas Meeting, Leipzig (invited); 2009-12-03 - 2009-12-04
• A Solver for QBFs in Negation Normal Form / U. Egly, M. Seidl, S. Woltran / Constraints, 14 (2009), 1; 38 - 79
• Relativized hyperequivalence of logic programs for modular programming / M. Truszczynski, S. Woltran / Theory and Practice of Logic Programming, Vol. 9 (2009), 6; 781 - 819
• Hyperequivalence of logic programs with respect to supported models / M. Truszczynski, S. Woltran / Annals of Mathematics and Artificial Intelligence, 53 (2009), 1-4; 331 - 365
• Modularity Aspects of Disjunctive Stable Models / T. Janhunen, E. Oikarinen, H. Tompits, S. Woltran / Journal of Artificial Intelligence Research, 35 (2009), 813 - 857
• Encoding deductive argumentation in quantified Boolean formulae / P. Besnard, A. Hunter, S. Woltran / Artificial Intelligence, 173 (2009), 15; 1406 - 1423
• Characterising Equilibrium Logic and Nested Logic Programs: Reductions and Complexity / D. Pearce, H. Tompits, S. Woltran / Theory and Practice of Logic Programming, 9 (2009), 5; 565 - 616
• spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics / M. Gebser, J. Puehrer, T. Schaub, H. Tompits, S. Woltran / in: "Applications of Declarative Programming and Knowledge Management", D. Seipel, M. Hanus, A. Wolf (ed.); Springer, 2009, ISBN: 978-3-642-00674-6, 247 - 252
• Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT / J. Oetsch, M. Seidl, H. Tompits, S. Woltran / in: "Applications of Declarative Programming and Knowledge Management", D. Seipel, M. Hanus, A. Wolf (ed.); Springer, 2009, ISBN: 978-3-642-00674-6, 241 - 246
• Belief Revision with Bounded Treewidth / S. Woltran / Talk: Dagstuhl Seminar 09351: Information processing, rational belief change and social interaction, Wadern, Schloss Dagstuhl, Deutschland (invited); 2009-08-23 - 2009-08-27; in: "Dagstuhl Seminar Proceedings", G. Bonanno, J. Delgrande, H. Rott (ed.); (2009), ISSN: 1862-4405; 51 pages
• ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions / J. Oetsch, M. Seidl, H. Tompits, S. Woltran / Talk: 10th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2009), Potsdam; 2009-09-14 - 2009-09-18; in: "Logic Programming and Nonmonotonic Reasoning", E. Erdem, F. Lin, T. Schaub (ed.); Springer, 5753 (2009), ISBN: 978-3-642-04237-9; 382 - 395
• Manifold Answer-Set Programs for Meta-Reasoning / W. Faber, S. Woltran / Talk: Workshop on Nonmonotonic Reasoning, Action and Change (NRAC'09), co-located with 21st Int. Joint Conf. on Artificial Intelligence (IJCAI-09), Pasadena, California, USA; 2009-07-11 - 2009-07-17; in: "Proc. of the IJCAI-09 Workshop on Nonmonotonic Reasoning, Action and Change (NRAC'09)", A. Herzig, B. Johnston (ed.); ePress of the University of Technology, Sydney, Sydney, Australia (2009), 33 - 40
• Answer-Set Programming with Bounded Tree Width / M. Jakl, R. Pichler, S. Woltran / Talk: 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), Pasadena, California, U.S.A.; 2009-07-11 - 2009-07-17; in: "Proc. of the Twenty-First Int. Joint Conference on Artificial Intelligence", C. Boutilier (ed.); AAAI Press, Menlo Park, California, U.S.A. (2009), ISBN: 978-1-57735-428-4; 816 - 822
• A Framework for Programming with Module Consequences / W. Faber, S. Woltran / Talk: 2nd International Workshop on Software Engineering for Answer Set Programming (SEA'09), co-located with the 10th Int. Conf. on Logic Programming and Nonmonotonic Reasoning (LPNMR'09), Potsdam; 2009-09-14 - 2009-09-18; in: "Proc. of the 2nd International Workshop on Software Engineering for Answer Set Programming (SEA'09)", M. De Vos, T. Schaub (ed.); (2009), ISSN: 1613-0073; 34 - 48
• Merging Logic Programs under Answer Set Semantics / J. Delgrande, T. Schaub, H. Tompits, S. Woltran / Talk: International Conference on Logic Programming (ICLP), Pasadena, Californien; 2009-07-14 - 2009-07-17; in: "Logic Programming", P. Hill, D. Warren (ed.); Springer, LNCS 5649 (2009), ISBN: 3-642-02845-4; 160 - 174
• Manifold Answer-Set Programs for Meta-reasoning / W. Faber, S. Woltran / Talk: 10th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2009), Potsdam; 2009-09-14 - 2009-09-18; in: "Logic Programming and Nonmonotonic Reasoning", E. Erdem, F. Lin, T. Schaub (ed.); Springer, 5753 (2009), ISBN: 978-3-642-04237-9; 115 - 128
• Belief Revision with Bounded Treewidth / R. Pichler, St. Rümmele, S. Woltran / Talk: 10th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2009), Potsdam; 2009-09-14 - 2009-09-18; in: "Logic Programming and Nonmonotonic Reasoning", E. Erdem, F. Lin, T. Schaub (ed.); Springer, 5753 (2009), ISBN: 978-3-642-04237-9; 250 - 263
• Alternation as a programming paradigm / W. Dvorak, G. Gottlob, R. Pichler, S. Woltran / Talk: PPDP'09 - 11th International ACM SIGPLAN Symposium on Princeples and Practice of Declarative Programming, Coimbra, Portugal; 2009-09-07 - 2009-09-09; in: "Proc. of the 11th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming", A. Porto, F. J. Lopez-Fraguas (ed.); ACM Press, (2009), ISBN: 978-1-60558-568-0; 61 - 72
• Technical Note: Complexity of Stage Semantics in Argumentation Frameworks / W. Dvorak, S. Woltran / Report No. DBAI-TR-2009-66, 2009; 13 pages
• Alternation as a Programming Paradigm / W. Dvorak, G. Gottlob, R. Pichler, S. Woltran / Report No. DBAI-TR-2009-64, 2009; 28 pages

2008

• A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming / S. Woltran / Theory and Practice of Logic Programming, 8 (2008), 2; 217 - 234
• Entailment for Domain-restricted RDF / R. Pichler, A. Polleres, F. Wei, S. Woltran / in: "Proceedings of the 5th Annual European Semantic Web Conference (ESWC'08)", Springer LNCS, 2008, ISBN: 978-3-540-68233-2, 200 - 214
• Contributions to Advanced Equivalence Checking in Answer Set Programming / Habilitation Thesis by S. Woltran / TU Wien, Fakultät für Informatik, 2008
• Hyperequivalence of programs and operators (Preliminary version) / M. Truszczynski, S. Woltran / Talk: Logic in Artificial Intelligence: Special Session in Honor of the 65th Birthday of Victor W. Marek, Fort Lauderdale, Florida, U.S.A. (invited); 2008-01-02 - 2008-01-04; in: "Tenth International Symposium on Artificial Intelligence and Mathematics (ISAIM)", M. Kaminski, M. Truszczynski (ed.); (2008), 8 pages
• Belief Revision of Logic Programs under Answer Set Semantics / J. Delgrande, T. Schaub, H. Tompits, S. Woltran / Talk: Principles of Knowledge Representation and Reasoning (KR), Sydney, Australien; 2008-09-16 - 2008-09-19; in: "Proceedings of the 11th Conference on Principles of Knowledge Representation and Reasoning (KR'08)", G. Brewka, J. Lang (ed.); AAAI Press, (2008), ISBN: 978-1-57735-384-3; 411 - 421
• Notions of Strong Equivalence for Logic Programs with Ordered Disjunction / W. Faber, H. Tompits, S. Woltran / Talk: Principles of Knowledge Representation and Reasoning (KR), Sydney, Australien; 2008-09-16 - 2008-09-19; in: "Proceedings of the 11th Conference on Principles of Knowledge Representation and Reasoning (KR'08)", G. Brewka, J. Lang (ed.); AAAI Press, (2008), ISBN: 978-1-57735-384-3; 433 - 443
• Relativized Hyperequivalence of Logic Programs for Modular Programming / M. Truszczynski, S. Woltran / Talk: International Conference on Logic Programming (ICLP), Udine; 2008-12-09 - 2008-12-13; in: "Proceedings of the 24th Conference on Logic Programming (ICLP'08)", M. de la Banda, E. Pontelli (ed.); Springer, 5366 (2008), ISBN: 978-3-540-89981-5; 576 - 590
• ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming / U. Egly, S. Gaggl, S. Woltran / Talk: International Conference on Logic Programming (ICLP), Udine; 2008-12-09 - 2008-12-13; in: "Proceedings of the 24th Conference on Logic Programming (ICLP'08)", M. de la Banda, E. Pontelli (ed.); Springer, 5366 (2008), ISBN: 978-3-540-89981-5; 734 - 738
• Answer-Set Programming Encodings for Argumentation Frameworks / U. Egly, S. Gaggl, S. Woltran / Talk: International Conference on Logic Programming (ICLP), Udine; 2008-12-09 - 2008-12-13; in: "ICLP-Workshop Proceedings; Proceedings of the 1st International Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2008", W. Faber, J. Lee (ed.); (2008), 1 - 15
• Hyperequivalence of Logic Programs with Respect to Supported Models / M. Truszczynski, S. Woltran / Talk: The Twenty-Third AAAI Conference on Artificial Intelligence and the Twentieth Innovative Applications of Artificial Intelligence Conference, Chicago, USA; 2008-07-13 - 2008-07-17; in: "AAAI-08/IAAI-08 Proceedings", A. Cohn, D. M. Hamilton (ed.); AAAI Press, Volume 1 (2008), ISBN: 978-1-57735-368-3; 560 - 565
• Fast Counting with Bounded Treewidth / M. Jakl, R. Pichler, St. Rümmele, S. Woltran / Talk: 15th Interantional Conference on Logic for Programmin, Artificial Intelligence, and Reasoning (LPAR), Doha, Qatar; 2008-11-22 - 2008-11-27; in: "Logic for Programming, Artificial Intelligence, and Reasoning", I. Cervesato, H. Veith, A. Voronkov (ed.); Springer, 5330 (2008), ISBN: 3-540-89438-1; 436 - 450
• Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence / J. Puehrer, H. Tompits, S. Woltran / Talk: International Conference on Logic Programming (ICLP), Udine, Italien; 2008-12-09 - 2008-12-13; in: "Proceedings of the 24th Conference on Logic Programming (ICLP'08)", M. de la Banda, E. Pontelli (ed.); Springer LNCS, 5366 (2008), ISSN: 0302-9743; 561 - 575
• Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets / M. Gebser, T. Schaub, H. Tompits, S. Woltran / Talk: 5th International Symposium on Foundations of Information and Knowledge Systems (FoIKS'08), Pisa, Italien; 2008-02-11 - 2008-02-15; in: "Proceedings of the 5th International Symposium on Foundations of Information and Knowledge Systems (FoIKS'08)", S. Hartmann, G. Kern-Isberner (ed.); Springer LNCS, 4932 (2008), ISBN: 978-3-540-77683-3; 24 - 41
• A Solver for QBFs in Negation Normal Form / U. Egly, M. Seidl, S. Woltran / Report for TU Wien. Institut für Informationssysteme 184/3, Abteilung für Wissensbasierte Systeme; Report No. INFSYS RR-1843-08-03, 2008; 44 pages
• Fast Counting with Bounded Treewidth / M. Jakl, R. Pichler, St. Rümmele, S. Woltran / Report No. DBAI-TR-2008-61, 2008; 27 pages
• dRDF: Entailment for Domain-Restricted RDF / R. Pichler, A. Polleres, F. Wei, S. Woltran / Report No. DBAI-TR-2008-59, 2008; 28 pages
• Relativized Hyperequivalence of Logic Programs for Modular Programming / M. Truszczynski, S. Woltran / Report No. DBAI-TR-2008-63, 2008; 37 pages
• Answer-Set Programming Encodings for Argumentation Frameworks / U. Egly, S. Gaggl, S. Woltran / Report No. DBAI-TR-2008-62, 2008; 25 pages
• Encoding Deductive Argumentation in Quantified Boolean Formulae / P. Besnard, A. Hunter, S. Woltran / Report No. DBAI-TR-2008-60, 2008; 28 pages
• Hyperequivalence of Logic Programs with Respect to Supported Models / M. Truszczynski, S. Woltran / Report No. DBAI-TR-2008-58, 2008; 32 pages

2007

• Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection / J. Oetsch, H. Tompits, S. Woltran / Poster: AAAI ' 07, Vancouver, Canada; 2007-07-22 - 2007-07-26
• Workshop on Correspondence and Equivalence for Nonmonotonic Theories (CENT 2007) / D. Pearce, A. Polleres, A. Valverde, S. Woltran / CEUR-Proceedings, Aachen, Vol. 265, 2007, ISSN: 1613-0073; 72 pages
• Semantical Characterizations and Complexity of Equivalences in Answer Set Programming / T. Eiter, M. Fink, S. Woltran / ACM Transactions on Computational Logic, 8 (2007), 3; 1 - 53
• Complexity results for answer set programming with bounded predicate arities and implications / T. Eiter, W. Faber, M. Fink, S. Woltran / Annals of Mathematics and Artificial Intelligence (invited), 51 (2007), 2-4; 123 - 165
• spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics / M. Gebser, J. Puehrer, T. Schaub, H. Tompits, S. Woltran / in: "Proc. of 17th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2007) and 21st Workshop on (Constraint) Logic Programming (WLP 2007)", Bayerische Julius-Maximilians-Universität Würzburg,, 2007, 4 pages
• Complexity Results for Checking Equivalence of Stratified Logic Programs / T. Eiter, M. Fink, H. Tompits, S. Woltran / Poster: International Joint Conference on Artificial Intelligence (IJCAI), Hyderabad, India; 2007-01-06 - 2007-01-12; in: "Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007)", M. Veloso (ed.); AAAI Press, (2007), ISBN: 978-1-57735-298-3; 330 - 335
• Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT / J. Oetsch, M. Seidl, H. Tompits, S. Woltran / Talk: Technical Report of 21st Workshop on (Constraint) Logic Programming (WLP 2007), Würzburg, Germany; 2007-10-04 - 2007-10-06; in: "Proc. of 17th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2007) and 21st Workshop on (Constraint) Logic Programming (WLP 2007)", Seite 254-257 (2007), 4 pages
• Characterizing Notions of Strong Equivalence for Logic Programs with Ordered Disjunctions / W. Faber, H. Tompits, S. Woltran / Talk: VLDB 2007, Wien; 2007-09-23 - 2007-09-24; in: "3rd Multidisciplinary Workshop on Advances in Preference Handling (M-PREF 2007)", (2007), 8 pages
• Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection / J. Oetsch, H. Tompits, S. Woltran / Talk: AAAI ' 07, Vancouver, Canada; 2007-07-22 - 2007-07-26; in: "Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence", AAAI Press, (2007), ISBN: 978-1-57735-323-2; Paper ID 05/AAAI07-072, 7 pages
• Facts do not Cease to Exist Because They are Ignored: Relativised Uniform Equivalence with Answer-Set Projection / J. Oetsch, H. Tompits, S. Woltran / Talk: Workshop on Correspondence and Equivalence for Nonmonotonic Theories (CENT 2007), Tempe, AZ, USA; 2007-05-14 - 2007-05-17; in: "Proceedings of the LPNMR'07 Workshop on Correspondence and Equivalence for Nonmonotonic Theories", D. Pearce, A. Polleres, S. Woltran, A. Valverde (ed.); (2007), 25 - 36
• Modularity Aspects of Disjunctive Stable Models / T. Janhunen, E. Oikarinen, H. Tompits, S. Woltran / Talk: International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), Tempe, AZ, USA; 2007-05-14 - 2007-05-17; in: "Proceeding of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR '07)", LNCS/Springer, 4483 (2007), ISBN: 978-3-540-72199-4; 175 - 187
• Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report / M. Gebser, T. Schaub, H. Tompits, S. Woltran / Talk: Workshop on Correspondence and Equivalence for Nonmonotonic Theories (CENT 2007), Tempe, AZ, USA; 2007-05-14 - 2007-05-17; in: "Proceedings of the LPNMR'07 Workshop on Correspondence and Equivalence for Nonmonotonic Theories", CEUR-Proceedings, 265 (2007), ISSN: 1613-0073; 37 - 48
• Complexity of Rule Redundancy in Non-Ground Answer-Set Programming over Finite Domains / M. Fink, R. Pichler, H. Tompits, S. Woltran / Talk: International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), Tempe, Arizona, USA; 2007-05-14 - 2007-05-17; in: "Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2007)", C. Baral, G. Brewka, J. Schlipf (ed.); Springer, LNAI 4483 (2007), ISBN: 978-3-540-72199-4; 123 - 135
• That is illogical Captain! The Debugging Support Tool spock for Answer-Set Programs -- System Description / M. Brain, M. Gebser, J. Puehrer, T. Schaub, H. Tompits, S. Woltran / Talk: First International Workshop Software Engineering for Answer Set Programming (SEA 2007), Tempe, AZ, USA; 2007-05-14 - 2007-05-17; in: "Proceeding of the LPNMR' 07 Workshop on Software Engineering for Answer Set Programming", (2007), 71 - 85
• Debugging ASP Programs by Means of ASP / M. Brain, M. Gebser, J. Puehrer, T. Schaub, H. Tompits, S. Woltran / Talk: International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), Tempe, AZ, USA; 2007-05-14 - 2007-05-17; in: "Proceeding of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR '07)", LNCS/Springer, 4483 (2007), ISBN: 978-3-540-72199-4; 31 - 43
• An Extension of the System ccT for Testing Relativised Uniform Equivalence under Answer-Set Projection / J. Oetsch, M. Seidl, H. Tompits, S. Woltran / accepted as talk for: Proceedings of the 16th International Conference on Computing (CIC 2007), Mexico City; 2007-11-04 - 2007-11-09; in: "Proceedings of the 16th International Conference on Computing (CIC 2007)", (2007)
• A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming / S. Woltran / Talk: Workshop on Correspondence and Equivalence for Nonmonotonic Theories (CENT 2007), Tempe, AZ, USA; 2007-05-14 - 2007-05-17; in: "Proceedings of the LPNMR'07 Workshop on Correspondence and Equivalence for Nonmonotonic Theories", CEUR-Proceedings, 265 (2007), ISSN: 1613-0073; 13 - 24
• Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report / D. Pearce, H. Tompits, S. Woltran / Talk: Workshop on Correspondence and Equivalence for Nonmonotonic Theories (CENT 2007), Tempe, AZ, USA; 2007-05-14 - 2007-05-17; in: "Proceedings of the LPNMR'07 Workshop on Correspondence and Equivalence for Nonmonotonic Theories", CEUR-Proceedings, 265 (2007), ISSN: 1613-0073; 49 - 60
• Characterising Equilibrium Logic and Nested Logic Programs: Reductions and Complexity / D. Pearce, H. Tompits, S. Woltran / Report for Universidad Rey Juan Carlos, Grupo de Inteligencia Artificial, 2007; Report No. GIA-TR-2007-12-01, 2007; 46 pages

2006

• Replacements in Non-Ground Answer-Set Programming / S. Woltran / Talk: Seminarvortrag, Comenius-Universitaet Bratislava (invited); 2006-10-12
• Replacements in Non-Ground Answer-Set Programming / S. Woltran / Talk: Seminarvortrag, Helsinki University of Technology, Laboratory for Theoretical Computer Science (invited); 2006-09-20
• Complexity Results for Checking Equivalence of Stratified Logic Programs / S. Woltran / Talk: Seminarvortrag, Universitaet Potsdam, Institut fuer Informatik (invited); 2006-07-13
• Proceedings of the 20th Workshop on Logic Programming (WLP 2006), Vienna, Austria, February 22--24 / M. Fink, H. Tompits, S. Woltran / TU Wien, Vienna, Austria, 2006, 210 pages
• A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results / J. Oetsch, M. Seidl, H. Tompits, S. Woltran / Talk: 20th Workshop on Logic Programming, Wien; 2006-02-22 - 2006-02-24; in: "Online Proceedings - WLP 2006", (2006)
• A Tool for Advanced Correspondence Checking in Answer-Set Programming / J. Oetsch, M. Seidl, H. Tompits, S. Woltran / Talk: 11th International Workshop on Nonmonotonic Reasoning, Lake District, UK; 2006-05-30 - 2006-06-01; in: "Proceedings is for the Eleventh International Workshop on Nonmonotonic Reasoning", (2006)
• A Solver for QBFs in Nonprenex Form: Overview and Experimental Results / U. Egly, M. Seidl, S. Woltran / Talk: Guangzhou Symposioum on Satisfiability in Logic-Based Modeling, Guangzhou, China (invited); 2006-09-24 - 2006-09-27; in: "Proceedings of the Guangzhou Symposioum on Satisfiability in Logic-Based Modeling", (2006), Paper ID 7, 11 pages
• Replacements in Non-Ground Answer-Set Programming / T. Eiter, M. Fink, H. Tompits, P. Traxler, S. Woltran / Talk: Workshop on Logic Programming (WLP), Vienna, Austira; 2006-02-22 - 2006-02-24; in: "Proceedings of the 20th Workshop on Logic Programming (WLP 2006), Vienna, Austria, February 22--24", M. Fink, H. Tompits, S. Woltran (ed.); TU Wien, Institut fuer Informationssysteme, INFSYS Research Report, 1843-06-02 (2006), Paper ID 24, 9 pages
• ccT: A Tool for Checking Advanced Correspondence Problems in Answer-Set Programming / J. Oetsch, M. Seidl, H. Tompits, S. Woltran / Talk: ICLP'06 Workshop: Lash'06, Seattle, Washington; 2006-08-16; in: "Proceedings", (2006)
• ccT: A Tool for Checking Advanced Correspondence Problems in Answer-Set Programming / J. Oetsch, M. Seidl, H. Tompits, S. Woltran / Talk: 15th International Conference on Computing (CIC 2006), Mexico City, Mexico; 2006-11-21 - 2006-11-24; in: "Proceedings of CIC-06", IEEE Computer Society, (2006), ISBN: 978-0-7695-2708-6; 3 - 11
• ccT: A Correspondence-Checking Tool For Logic Programs Under The Answer-Set Semantics / J. Oetsch, M. Seidl, H. Tompits, S. Woltran / Talk: 10th European Conference on Logics in Artificial Intelligence, Liverpool, UK; 2006-09-13 - 2006-09-15; in: "Proceedings of the JELIA2006", Springer, LNCS - Logics in Artificial Intelligence/4160 (2006), ISBN: 978-3-540-39625-3; 502 - 505
• A Solver for QBFs in Nonprenex Form / U. Egly, M. Seidl, S. Woltran / Talk: 17th European Conference on Artificial Intelligence, Riva del Garda, Italy; 2006-08-29 - 2006-09-01; in: "Proceedings of the ECAI 2006", IOS Press, (2006), ISBN: 1-58603-642-4; 477 - 481
• An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs / T. Eiter, P. Traxler, S. Woltran / Talk: 10th European Conference, JELIA 2006, Liverpool, UK; 2006-09-13 - 2006-09-15; in: "Proceedings of the 10th European Conference on Logics in Artificial Intelligence (JELIA 2006)", M. Fisher, W. van der Hoek, B. Konev, A. Lisitsa (ed.); Springer, LNCS 4160 (2006), ISBN: 3-540-39625-x; 477 - 480
• Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas / U. Egly, S. Woltran / Talk: COMMA - International Conference on Computational Models of Argument, Liverpool, UK; 2006-09-11 - 2006-09-12; in: "Proceedings of the 1st International Conference on Computational Models of Argument (COMMA 2006)", P. Dunne, T. Bench-Capon (ed.); IOS Press, (2006), ISBN: 1-58603-652-1; 133 - 144
• Replacements in Non-Ground Answer-Set Programming / T. Eiter, M. Fink, H. Tompits, P. Traxler, S. Woltran / Talk: Principles of Knowledge Representation and Reasoning (KR), Lake District, UK; 2006-06-02 - 2006-06-05; in: "Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR 2006), Lake District of the United Kingdom, June 2--5", P. Doherty, J. Mylopoulos, C. Welty (ed.); AAAI Press, (2006), ISBN: 978-1-57735-271-6; 340 - 351

2005

• Survey of Equivalences in ASP / S. Woltran / Talk: Seminarvortrag, Universitaet Potsdam (invited); 2005-11-23
• Solution Correspondences in Answer-Set Programming: An Overview / S. Woltran / Talk: Seminarvortrag, Universidad Rey Juan Carlos, Mostoles, Spanien (invited); 2005-10-06
• Node Presentation: TU Wien / S. Woltran / Talk: International Workshop on Answer Set Programming (ASP), Bath, UK (invited); 2005-07-27
• Solution Correspondences in Answer-Set Programming: An Overview / S. Woltran / Talk: Seminarvortrag, Universita' della Calabria, Italien (invited); 2005-06-10
• On Solution Correspondences in Answer Set Programming: A General Framework (and Characterizations for the Ground Case) / S. Woltran / Talk: Dagstuhl Seminar Nr. 05171, Nonmonotonic Reasoning, Answer Set Programming and Constraints, Dagstuhl, Deutschland (invited); 2005-04-24 - 2005-04-29
• Representing Paraconsistent Reasoning via Quantified Propositional Logic / P. Besnard, T. Schaub, H. Tompits, S. Woltran / in: "Inconsistency Tolerance", L. Bertossi et al. (ed.); Springer, LNCS 3300, 2005, ISBN: 3-540-24260-0, 84 - 118
• On Deciding Subsumption Problems / U. Egly, R. Pichler, S. Woltran / Annals of Mathematics and Artificial Intelligence, 43 (2005), 1-4; 255 - 294
• Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming / H. Tompits, S. Woltran / Talk: International Workshop on Answer Set Programming (ASP), Bath, UK; 2005-07-27 - 2005-07-29; in: "Answer Set Programming, Advances in Theory and Implementation, Proceedings of the 3rd Intl. ASP'05 Workshop", M. De Vos, A. Provetti (ed.); CEUR Workshop Proceedings, 142 (2005), 115 - 129
• Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming / H. Tompits, S. Woltran / Talk: International Conference on Logic Programming (ICLP), Sitges, Spain; 2005-10-02 - 2005-10-05; in: "Proceedings of the 21st International Conference on Logic Programming", M. Gabbrielli, G. Gupta (ed.); Springer, LNCS 3668 (2005), ISBN: 3-540-29208-x; 189 - 203
• On Solution Correspondences in Answer-Set Programming / T. Eiter, H. Tompits, S. Woltran / Talk: International Joint Conference on Artificial Intelligence (IJCAI), Edinburgh, Scottland; 2005-07-30 - 2005-08-05; in: "Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05)", (2005), ISBN: 0-938075-93-4; 97 - 102
• Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case / T. Eiter, M. Fink, H. Tompits, S. Woltran / Talk: National Conference on Artificial Intelligence (AAAI), Pittsburgh, Pennsylvania, USA; 2005-07-09 - 2005-07-13; in: "Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference,", AAAI Press / The MIT Press 2005, (2005), ISBN: 1-57735-236-x; 695 - 700
• Semantical Characterizations and Complexity of Equivalences in Answer Set Programming / T. Eiter, M. Fink, S. Woltran / Report for TU Wien, Institut fuer Informationssysteme, INFSYS RR-1843-05-01; 2005; 58 pages

2004

• Complexity of Equivalence between Propositional Logic Programs / S. Woltran / Talk: Seminarvortrag, Bratislava, Slowakei (invited); 2004-11-05
• Relativized Notions of Equivalence in ASP / S. Woltran / Talk: Seminarvortrag, Universitaet Potsdam, Institut fuer Informatik (invited); 2004-08-18
• Elimination of Disjunction in Stable Logic Programming / S. Woltran / Talk: Seminarvortrag, Bratislava, Slowakei (invited); 2004-05-17
• On Simplifying and Rewriting Logic Programs: Characterisations and Complexity / H. Tompits, S. Woltran / Talk: Seminarvortrag, Bratislava, Slowakei (invited); 2004-01-30
• On Computing Solutions to Belief Change Scenarios / J. Delgrande, T. Schaub, H. Tompits, S. Woltran / Journal of Logic and Computation, 14 (2004), 6; 801 - 826
• KR 2004 - Konferenzbericht / W. Faber, S. Woltran / ÖGAI Journal, 23 (2004), 24 - 27
• nlp: A Compiler for Nested Logic Programming / V. Sarsakov, T. Schaub, H. Tompits, S. Woltran / in: "Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning", V. Lifschitz, I. Niemelä (ed.); Springer, LNAI 2923, 2004, ISBN: 3-540-20721-x, 361 - 364
• Characterizations for Relativized Notions of Equivalence in Answer Set Programming / S. Woltran / Talk: European Conference on Logics in Artificial Intelligence (JELIA), Lisbon, Portugal; 2004-09-27 - 2004-09-30; in: "Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA 2004)", J. Alferes, J. Leite (ed.); Springer, LNAI 3229 (2004), ISBN: 3-540-23242-7; 161 - 173
• Comparing Different Prenexing Strategies for Quantified Boolean Formulas / U. Egly, M. Seidl, H. Tompits, S. Woltran, M. Zolda / Talk: International Conference on the Theory and Applications of Satisfiability Testing, Santa Margherita Ligure, Italy; 2003-05-05 - 2003-05-08; in: "Theory and Application of Satisfiability. Selected Revised Papers.", E. Giunchiglia, A. Tacchella (ed.); Springer, LNCS 2919 (2004), ISBN: 3-540-20851-8; 214 - 228
• On Acyclic and Head-Cycle Free Nested Logic Programs / T. Linke, H. Tompits, S. Woltran / Talk: International Conference on Logic Programming (ICLP), Saint-Malo, France; 2004-09-06 - 2004-09-10; in: "Proceedings of the 20th International Conference on Logic Programming", B. Demoen, V. Lifschitz (ed.); Springer, LNCS 3132 (2004), ISBN: 3-540-22671-0; 225 - 239
• On Acyclic and Head-Cycle Free Nested Logic Programs / T. Linke, H. Tompits, S. Woltran / Talk: International Workshop on Non-Monotonic Reasoning (NMR), Whistler, BC, Canada; 2004-06-06 - 2004-06-08; in: "Proceedings of the 10th International Workshop on Non-Monotonic Reasoning", J. Delgrande, T. Schaub (ed.); (2004), ISBN: 92-990021-0-x; 267 - 275
• Simplifying Logic Programs under Uniform and Strong Equivalence / T. Eiter, M. Fink, H. Tompits, S. Woltran / Talk: International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), Fort Lauderdale, FL, USA; 2004-01-06 - 2004-01-08; in: "Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning", V. Lifschitz, I. Niemelä (ed.); Springer, LNAI 2923 (2004), ISBN: 3-540-20721-x; 87 - 99
• On Eliminating Disjunctions in Stable Logic Programming / T. Eiter, M. Fink, H. Tompits, S. Woltran / Talk: Principles of Knowledge Representation and Reasoning (KR), Whistler, BC, Canada; 2004-06-02 - 2004-06-05; in: "Principles of Knowledge Representation and Reasoning, Proceedings of the Ninth International Conference", D. Dubois, C. Welty, M.-A. Williams (ed.); AAAI Press, (2004), ISBN: 1-57735-201-7; 447 - 457
• Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming / T. Eiter, W. Faber, M. Fink, G. Pfeifer, S. Woltran / Talk: Principles of Knowledge Representation and Reasoning (KR), Whistler, BC, Canada; 2004-06-02 - 2004-06-05; in: "Principles of Knowledge Representation and Reasoning, Proceedings of the Ninth Conference", D. Dubois, C. Welty, M.-A. Williams (ed.); AAAI Press, Menlo Park, CA, USA (2004), ISBN: 1-57735-199-1; 377 - 387

2003

• Paraconsistent Reasoning via QBFs / S. Woltran / Talk: Dagstuhl Seminar Nr. 03241, Inconsistency Tolerance, Dagstuhl, Germany (invited); 2003-06-09 - 2003-06-13
• Quantified Boolean Formulas - From Theory to Practice / PhD Thesis by S. Woltran / Supervisor, Reviewer: U. Egly; Institut fuer Informationssysteme, 2003
• Comparing different prenexing strategies for quantified boolean formulas / U. Egly, M. Seidl, H. Tompits, S. Woltran, M. Zolda / Talk: International Conference on the Theory and Applications of Satisfiability Testing, S. Margherita Ligure - Portofino ( Italy); 2003-05-05 - 2003-05-08; in: " Proceedings of the 6th International Conference on the Theory and Applications of Satisfiability Testing (SAT-03)", J. Franco et al. (ed.); Springer, (2003), ISBN: 3-540-20851-8; 370 - 378
• On Implementing Nested Logic Programms: Overview and Comparisons / D. Pearce, V. Sarsakov, T. Schaub, H. Tompits, S. Woltran / Talk: 17th Workshop on Logic Programming and Constraint Systems (WLP-02), Dresen, Germany; 2002-12-11 - 2002-12-13; in: "Proceedings of the 17th Workshop on Logic Programming and Constraint Systems", B. Fronhoefer, S. Hölldobler (ed.); (2003), ISSN: 1430-211x; 81 - 95
• Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming / T. Eiter, W. Faber, M. Fink, G. Pfeifer, S. Woltran / Talk: 2nd Intl. Answer Set Programming Workshop, Messina, Italy; 2003-09-26 - 2003-09-28; in: "Answer Set Programming - Advances in Theory and Implementation", M. De Vos, A. Provetti (ed.); CEUR-WS, 78 (2003), ISSN: 1613-0073; 69 - 83
• Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation / T. Eiter, M. Fink, H. Tompits, S. Woltran / Talk: 2nd Intl. Answer Set Programming Workshop, Messina, Italy; 2003-09-26 - 2003-09-28; in: "Answer Set Programming - Advances in Theory and Implementation", M. De Vos, A. Provetti (ed.); CEUR-WS, 78 (2003), ISSN: 1613-0073; 151 - 165
• Paraconsistent Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories / P. Besnard, T. Schaub, H. Tompits, S. Woltran / Talk: III World Congress on Paraconsistency, Toulouse, France; 2003-07-28 - 2003-07-31; in: " Proceedings of the III World Congress on Paraconsistency", (2003), 73 - 84
• Paraconsistent Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories / P. Besnard, T. Schaub, H. Tompits, S. Woltran / Talk: ECSQARU 2003, Aalborg, Denmark; 2003-07-02 - 2003-07-05; in: "Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 7th European Conference", T. Nielsen, N. Zhang (ed.); Springer, Lecture Notes in Computer Science 2711 (2003), ISBN: 3-540-40494-5; 528 - 539
• Methods for data acquisition and transformation / T. Eiter, W. Faber, M. Fink, S. Woltran, L. Zalewska / Report for European Commission, IST 2001-33570 (INFOMIX), D6.2; 2003
• Complexity of Answer Set Checking and Bounded Predicate Arities for Non-Ground Answer Set Programming / T. Eiter, W. Faber, G. Pfeifer, M. Fink, S. Woltran / 2003
• On Eliminating Disjunctions in Stable Logic Programming / T. Eiter, M. Fink, H. Tompits, S. Woltran / 2003
• On Deciding Subsumption Problems / U. Egly, R. Pichler, S. Woltran / 2003
• On Computing Solutions to Belief Change Scenarios / J. Delgrande, T. Schaub, H. Tompits, S. Woltran / 2003

2002

• Deciding Strong Equivalence between Logic Programs / S. Woltran / Talk: Seminarvortrag, Universität Potsdam, Institut für Informatik (invited); 2002-12-10
• On Implementing Nested Logic Programs / S. Woltran / Talk: Dagstuhl Seminar Nr. 02381, Nonmonotonic Reasoning, Answer Set Programming and Constraints, Dagstuhl, Germany (invited); 2002-09-15 - 2002-09-20
• Die Federated Logic Conference (FLoC) / S. Woltran / Computer kommunikativ, 5 (2002), 27 - 28
• Konferenzbericht FLOC-2002 / S. Woltran / ÖGAI Journal, 21 (2002), 3; 23 - 25
• A Framework for Solving Advanced Reasoning Tasks - Summary of the Thesis / S. Woltran / ÖGAI Journal, 21 (2002), 4; 29 - 33
• A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report / D. Pearce, V. Sarsakov, T. Schaub, H. Tompits, S. Woltran / Talk: 9th International Workshop on Non-Monotonic Reasoning (NMR'2002), Toulouse, France; 2002-04-19 - 2002-04-21; in: "Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR'2002)", S. Benferhat, E. Giunchiglia (ed.); (2002), 57 - 66
• A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report / D. Pearce, V. Sarsakov, T. Schaub, H. Tompits, S. Woltran / Talk: International Conference on Logic Programming (ICLP), Copenhagen, Denmark; 2002-07-29 - 2002-08-01; in: "Proceedings of the 18th International Conference on Logic Programming", P. Stuckey (ed.); Springer Verlag, (2002), ISBN: 3-540-43930-7; 405 - 420
• Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks / T. Eiter, V. Klotz, H. Tompits, S. Woltran / Talk: Analytic Tableaux and Related Methods (TABLEAUX), Copenhagen, Denmark; 2002-07-30 - 2002-08-01; in: "Proceedings of the Eleventh Conference on Automated Reasoning with Analytic Tableaux and Related Methods", U. Egly, C. Fermüller (ed.); Springer Verlag, (2002), ISBN: 3-540-43929-3; 100 - 114
• Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems / P. Besnard, T. Schaub, H. Tompits, S. Woltran / Talk: 8th European Conference on Artificial Intelligence, JELIA 2002, Cosenza, Italy; 2002-09-23 - 2002-09-26; in: "Logics in Artificial Intelligence", S. Flesca, S. Greco, N. Leone, G. Ianni (ed.); Springer Verlag, (2002), ISBN: 3-540-44190-5; 320 - 331
• On Deciding Subsumption Problems / U. Egly, R. Pichler, S. Woltran / Talk: Fifth Internternational Symposium on the Theory and Applications of Satisfiability Testing (SAT-02), Cincinnati, Ohio, USA; 2002-05-06 - 2002-05-09; in: "Proceedings of the Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT-02)", J. Franco et al. (ed.); (2002), 89 - 97
• On Quantifier Shifting for Quantified Boolean Formulas / U. Egly, H. Tompits, S. Woltran / Talk: Fifth Internternational Symposium on the Theory and Applications of Satisfiability Testing (SAT-02), Cincinnati, Ohio, USA; 2002-05-06 - 2002-05-09; in: "Proceedings Quantified Boolean Formulas Workshop", T. Walsh, E. Giunchiglia (ed.); (2002), 48 - 61
• Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems / P. Besnard, T. Schaub, H. Tompits, S. Woltran / Talk: Paraconsistent Computational Logic (PCL 2002), Copenhagen, Denmark; 2002-07-27; in: "Proceedings of the ICLP 2002 Workshop Paraconsistent Computational Logic", H. Decker, J. Villadson, T. Waragai (ed.); Volume 95 of Datalogiske Skrifter, Roskilde, Denmark (2002), 1 - 15
• Polynomial Translations of Nested Logic Programs into Disjunctive Logic Programs / D. Pearce, T. Schaub, V. Sarsakov, H. Tompits, S. Woltran / 2002

2018

• Advancements in Equivalence Checking for Abstract Argumentation Frameworks / Master Thesis by P. Bellositz / Supervisor: W. Dvorak, S. Woltran; Instute of Logic and Computation, E192-02, 2018; final examination: 2018-10-03
• A Solver for the Steiner Tree Problem with few Terminals / Master Thesis by A. Schidler / Supervisor: S. Woltran, J. Fichte; Institute of Logic and Computation, 2018; final examination: 2018-11-12
• Solving #SAT on the GPU with Dynamic Programming and OpenCL / Master Thesis by M. Zisser / Supervisor: S. Woltran, J. Fichte; Institute of Logic and Computation, 2018; final examination: 2018-06-04

2017

• BDD-based Dynamic Programming on Tree Decompositions - Towards an Alternative Approach for Efficient (QBF) Solving / PhD Thesis by G. Charwat / Supervisor, Reviewer: L. Pulina, M. Seidl, S. Woltran; Institut fuer Informationssysteme, 2017; oral examination: 2017-09-22
• Tailored Tree Decompositions for Efficient Problem Solving / PhD Thesis by M. Abseher / Supervisor, Reviewer: S. Woltran, L. Di Gaspero, R. Niedermeier; Institut fuer Informationssysteme, 2017; oral examination: 2017-04-28
• Set- and Graph-theoretic Investigations in Abstract Argumentation / PhD Thesis by C. Spanring / Supervisor, Reviewer: P. Dunne, D. Grossi, S. Woltran, F. Wolter, P. Baroni; Institut fuer Informationssysteme, 2017; oral examination: 2017-09-13
• Developing the Abstract Dialectical Framework / PhD Thesis by S. Polberg / Supervisor, Reviewer: S. Woltran, L. van der Torre, S. Modgil; Institut fuer Informationssysteme, 2017; oral examination: 2017-08-16
• Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs / PhD Thesis by B. Bliem / Supervisor, Reviewer: S. Woltran, F. Scarcello, G. Woeginger; Institut für Informationssysteme, 2017; oral examination: 2017-10-20
• Advances in Abstract Argumentation - Expressiveness and Dynamics / PhD Thesis by T. Linsbichler / Supervisor, Reviewer: S. Woltran, W. Dvorak; Institut fuer Informationssysteme, 2017; oral examination: 2017-06-30
• Investigating subclasses of abstract dialectical frameworks / Master Thesis by A. Keshavarzi / Supervisor: S. Woltran, M. Diller, T. Linsbichler; Institut fuer Informationssysteme, 2017; final examination: 2017-10-03

2016

• Designing a System for the Experimental Analysis and Visualization of Dynamic Programming on Tree Decompositions / Master Thesis by T. Ambroz, A. Jusits / Supervisor: S. Woltran, G. Charwat; Institut für Informationssysteme, 2016; final examination: 2016-02-29
• A System For Advanced Graphical Argumentation Formalisms / Master Thesis by G. Heißenberger / Supervisor: S. Woltran, M. Diller; Institut für Informationssysteme, 2016; final examination: 2016-03-14

2015

• Implementing Variations of the Traveling Salesperson Problem in a Declarative Dynamic Programming Environment / Master Thesis by M. Moldovan / Supervisor: S. Woltran; Institut für Informationssysteme, 2015; final examination: 2015-04-15
• Optimizing Second-Level Dynamic Programming Algorithms / Master Thesis by M. Hecher / Supervisor: S. Woltran; Institut für Informationssysteme, 2015; final examination: 2015-11-09

2014

• Answer Set Programming with External Sources: Algorithms and Efficient Evaluation / PhD Thesis by C. Redl / Supervisor, Reviewer: T. Eiter, S. Woltran, G. Ianni; Institut für Informationssystems, 2014; oral examination: 2014-05-28
• Complexity Results and Algorithms for Argumentation - Dung's Frameworks and Beyond / PhD Thesis by J. P. Wallner / Supervisor, Reviewer: S. Woltran, G. Weissenbacher; Institute of Information Systems, 2014; oral examination: 2014-05-28
• Merging in the Horn fragment / Master Thesis by A. Haret / Supervisor: S. Woltran, St. Rümmele; Institut für Informationssysteme, 2014; final examination: 2014-09-23
• Solving Reasoning Problems on Abstract Dialectical Frameworks via Quantified Boolean Formulas / Master Thesis by M. Diller / Supervisor: S. Woltran, J. P. Wallner; Institut für Informationssysteme, 2014; final examination: 2014-04-11

2013

• A Comprehensive Analysis of the cf2 Argumentation Semantics: From Characterization to Implementation / PhD Thesis by S. Gaggl / Supervisor, Reviewer: S. Woltran, P. Baroni; Institut für Informationssysteme, 2013; oral examination: 2013-03-04
• On the Limits of Expressiveness in Abstract Argumentation Semantics: Realizability and Signatures / Master Thesis by T. Linsbichler / Supervisor: S. Woltran, W. Dvorak; Institut für Informationssysteme, 2013; final examination: 2013-06-11
• Argumentation and Answer-Set Programming Modelling the Resolution-Based Grounded Semantics / Master Thesis by C. Weichselbaum / Supervisor: S. Woltran, S. Gaggl; Institut für Informationssysteme, 2013; final examination: 2013-03-04
• Solving shift design problems with answer set programming / Master Thesis by M. Abseher / Supervisor: N. Musliu, S. Woltran; Institut für Informationssysteme, 2013; final examination: 2013

2012

• Computational Aspects of Abstract Argumentation / PhD Thesis by W. Dvorak / Supervisor, Reviewer: S. Woltran, P. Dunne; Institut für Informationssysteme, 2012; oral examination: 2012-04-11
• Tree-Decomposition based Algorithms for Abstract Argumentation Frameworks / Master Thesis by G. Charwat / Supervisor: S. Woltran, W. Dvorak; Institut für Informationssysteme, 2012; final examination: 2012-02-22
• Abstract Dialectical Frameworks: Properties, Complexity, and Implementation / Master Thesis by St. Ellmauthaler / Supervisor: S. Woltran, J. P. Wallner; Institut für Informationssysteme, 2012; final examination: 2012-09-13
• Decompose, guess and check : declarative problem solving on tree decompositions / Master Thesis by B. Bliem / Supervisor: S. Woltran, R. Pichler; Institut für Informationssysteme, 2012; final examination: 2012-11-19

2011

• dynASP - A Dynamic-Programming Based Answer Set Programming Solver / Master Thesis by M. Morak / Supervisor: S. Woltran, St. Rümmele; Institut für Informationssysteme, 2011; final examination: 2011-01-27

2010

• Fixed parameter algorithms for answer set programming / PhD Thesis by M. Jakl / Supervisor, Reviewer: R. Pichler, S. Woltran; Institut für Informationssysteme, 2010; oral examination: 2010-06-29

2009

• Decentralized Diagnosis: Complexity Analysis and Datalog Encodings / Master Thesis by A. Pfandler / Supervisor: R. Pichler, S. Woltran; Institut für Informationssysteme, Arbeitsbereich Datenbanken & Artificial Intelligence, 2009; final examination: 2009-11
• Complexity of Argumentation / Master Thesis by A. Roubickova / Supervisor: R. Pichler, S. Woltran; Institut fuer Informationssysteme, 2009; final examination: 2009-11-01
• Solving Argumentation Frameworks using Answer Set Programming / Master Thesis by S. Gaggl / Supervisor: U. Egly, S. Woltran; Institut für Informationssysteme, Arbeitsbereich Datenbanken & Artificial Intelligence, 2009; final examination: 2009-02
• Alternation as a programming paradigm / Master Thesis by W. Dvorak / Supervisor: R. Pichler, S. Woltran; Institut für Informationssysteme, Arbeitsbereich Datenbanken & Artificial Intelligence, 2009; final examination: 2009-02

2008

• Efficient Counting with Bounded Treewidth using Datalog / Master Thesis by St. Rümmele / Supervisor: R. Pichler, S. Woltran; Institut für Informationssysteme, Arbeitsbereich Datenbanker & Artificial Intelligence, 2008; final examination: 2008-12

2007

• A Solver for Quantified Boolean Formulas in Negation Normal Form / PhD Thesis by M. Seidl / Supervisor, Reviewer: U. Egly, S. Woltran; Institut für Informationssysteme, 2007; oral examination: 2007-03-20
• On Replacements in Answer-Set Programming based On Partial Evaluation / Master Thesis by A. Heindl / Supervisor: H. Tompits, S. Woltran; Institut für Informationssysteme, 2007; final examination: 2007-02-28

2006

• Techniques for Simplifying Disjunctive Datalog Programs with Negation / Master Thesis by P. Traxler / Supervisor: T. Eiter, S. Woltran; Institut fuer Informationssystem, 184/3, 2006; final examination: 2006

2004

• Comparing Different Prenexing Strategies for Quantified Boolean Formulas / Master Thesis by M. Zolda / Supervisor: U. Egly, S. Woltran; Institut fuer Informationssysteme, 2004

• EurAI Fellows programme / EurAI Fellow / Website / 2018
• Treating Hard Problems with Decomposition and Dynamic Programming (Decodyn) / START-Programm / Austria / Website / Project / 2014
• Distinguished student paper prize at the 13th International Conference on Principles of Knowledge Representation and Reasoning. / KR Inc / 2012
• OCG-Förderpreis / Austria / 2002

Soon, this page will include additional information such as reference projects, activities as journal reviewer and editor, memberships in councils and committees, and other research activities.

Until then, please visit Stefan Woltran’s research profile in TISS .