| 2026 | KR | Splitting Assumption-Based Argumentation Frameworks. | Giovanni Buraglio, Wolfgang Dvork, Stefan Woltran |
| 2026 | KR | Simple Guess-and-Check Programs: Strong and Uniform Equivalence Meet Again. | Wolfgang Dvork, Zeynep G. Saribatur, Stefan Woltran |
| 2025 | ECAI | A Novel Equivalence Notion to Compare Answer-Set Programs over Multi-Layered Inputs. | Tobias Geibinger, Zeynep G. Saribatur, Stefan Woltran |
| 2025 | KR | FastFound: Easing the ASP Bottleneck via Predicate-Decoupled Grounding. | Alexander Beiser, Martin Gebser, Markus Hecher, Stefan Woltran |
| 2024 | AAAI | Redefining ABA+ Semantics via Abstract Set-to-Set Attacks. | Yannis Dimopoulos, Wolfgang Dvork, Matthias Knig, Anna Rapberger, Markus Ulbricht, Stefan Woltran |
| 2024 | AAAI | A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming. | Zeynep G. Saribatur, Stefan Woltran |
| 2024 | COMMA | Splitting Argumentation Frameworks with Collective Attacks. | Giovanni Buraglio, Wolfgang Dvork, Matthias Knig, Stefan Woltran |
| 2024 | COMMA | The GSAF Solver and Verifier. | Alexander Greler, Wolfgang Dvork, Stefan Woltran |
| 2024 | IJCAI | Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting. | Alexander Beiser, Markus Hecher, Kaan Unalan, Stefan Woltran |
| 2024 | IJCAI | Epistemic Logic Programs: Non-Ground and Counting Complexity. | Thomas Eiter, Johannes Klaus Fichte, Markus Hecher, Stefan Woltran |
| 2024 | SAC | Equipping Abstract Argumentation Solvers for Verifying Negative Results. | Wolfgang Dvork, Alexander Greler, Stefan Woltran |
| 2023 | AAAI | The Effect of Preferences in Abstract Argumentation under a Claim-Centric View. | Michael Bernreiter, Wolfgang Dvork, Anna Rapberger, Stefan Woltran |
| 2023 | ECAI | On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth. | Viktor Besin, Markus Hecher, Stefan Woltran |
| 2023 | KR | Foundations for Projecting Away the Irrelevant in ASP Programs. | Zeynep G. Saribatur, Stefan Woltran |
| 2022 | AAAI | Tractable Abstract Argumentation via Backdoor-Treewidth. | Wolfgang Dvork, Markus Hecher, Matthias Knig, Andr Schidler, Stefan Szeider, Stefan Woltran |
| 2022 | CADE | Sequent Calculi for Choice Logics. | Michael Bernreiter, Anela Lolic, Jan Maly, Stefan Woltran |
| 2022 | COMMA | Abstract Argumentation with Conditional Preferences. | Michael Bernreiter, Wolfgang Dvork, Stefan Woltran |
| 2022 | COMMA | Treewidth for Argumentation Frameworks with Collective Attacks. | Wolfgang Dvork, Matthias Knig, Stefan Woltran |
| 2022 | COMMA | Deletion-Backdoors for Argumentation Frameworks with Collective Attacks. | Wolfgang Dvork, Matthias Knig, Stefan Woltran |
| 2022 | COMMA | Non-Admissibility in Abstract Argumentation. | Wolfgang Dvork, Tjitze Rienstra, Leendert van der Torre, Stefan Woltran |
| 2022 | IJCAI | Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck. | Viktor Besin, Markus Hecher, Stefan Woltran |
| 2022 | IJCAI | Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Extended Abstract). | Viktor Besin, Markus Hecher, Stefan Woltran |
| 2022 | KR | Rediscovering Argumentation Principles Utilizing Collective Attacks. | Wolfgang Dvork, Matthias Knig, Markus Ulbricht, Stefan Woltran |
| 2021 | AAAI | Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility. | Wolfgang Dvork, Markus Ulbricht, Stefan Woltran |
| 2021 | AAAI | The Complexity Landscape of Claim-Augmented Argumentation Frameworks. | Wolfgang Dvork, Alexander Greler, Anna Rapberger, Stefan Woltran |
| 2021 | IJCAI | Choice Logics and Their Computational Properties. | Michael Bernreiter, Jan Maly, Stefan Woltran |
| 2021 | JELIA | Graph-Classes of Argumentation Frameworks with Collective Attacks. | Wolfgang Dvork, Matthias Knig, Stefan Woltran |
| 2021 | KR | On the Complexity of Preferred Semantics in Argumentation Frameworks with Bounded Cycle Length. | Wolfgang Dvork, Matthias Knig, Stefan Woltran |
| 2020 | AAAI | Structural Decompositions of Epistemic Logic Programs. | Markus Hecher, Michael Morak, Stefan Woltran |
| 2020 | COMMA | Ranking-Based Semantics from the Perspective of Claims. | Stefano Bistarelli, Wolfgang Dvork, Carlo Taticchi, Stefan Woltran |
| 2020 | COMMA | The ASPARTIX System Suite. | Wolfgang Dvork, Sarah Alice Gaggl, Anna Rapberger, Johannes P. Wallner, Stefan Woltran |
| 2020 | COMMA | Expressiveness of SETAFs and Support-Free ADFs Under 3-Valued Semantics. | Wolfgang Dvork, Atefeh Keshavarzi Zafarghandi, Stefan Woltran |
| 2020 | ECAI | On the Relation Between Claim-Augmented Argumentation Frameworks and Collective Attacks. | Wolfgang Dvork, Anna Rapberger, Stefan Woltran |
| 2020 | ECAI | Explaining Non-Acceptability in Abstract Argumentation. | Zeynep G. Saribatur, Johannes P. Wallner, Stefan Woltran |
| 2020 | ICLP | Encoding Choice Logics in ASP. | Michael Bernreiter, Jan Maly, Stefan Woltran |
| 2020 | ICLP | Structural Decompositions of Epistemic Logic Programs. | Markus Hecher, Michael Morak, Stefan Woltran |
| 2020 | KR | Argumentation Semantics under a Claim-centric View: Properties, Expressiveness and Relation to SETAFs. | Wolfgang Dvork, Anna Rapberger, Stefan Woltran |
| 2020 | PADL | Exploiting Database Management Systems and Treewidth for Counting. | Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran |
| 2020 | SAT | Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology. | Markus Hecher, Patrick Thier, Stefan Woltran |
| 2019 | AAAI | Forgetting in Modular Answer Set Programming. | Ricardo Gonalves, Tomi Janhunen, Matthias Knorr, Joo Leite, Stefan Woltran |
| 2019 | AAAI | Strong Equivalence for Epistemic Logic Programs Made Easy. | Wolfgang Faber, Michael Morak, Stefan Woltran |
| 2019 | AAAI | Complexity of Abstract Argumentation under a Claim-Centric View. | Wolfgang Dvork, Stefan Woltran |
| 2019 | IJCAI | Belief Revision Operators with Varying Attitudes Towards Initial Beliefs. | Adrian Haret, Stefan Woltran |
| 2019 | JELIA | Multi-valued GRAPPA. | Gerhard Brewka, Jrg Phrer, Stefan Woltran |
| 2019 | JELIA | Preprocessing Argumentation Frameworks via Replacement Patterns. | Wolfgang Dvork, Matti Jrvisalo, Thomas Linsbichler, Andreas Niskanen, Stefan Woltran |
| 2019 | KI | Strong Equivalence for Argumentation Frameworks with Collective Attacks. | Wolfgang Dvork, Anna Rapberger, Stefan Woltran |
| 2018 | AAAI | Weighted Abstract Dialectical Frameworks. | Gerhard Brewka, Hannes Strass, Johannes P. Wallner, Stefan Woltran |
| 2018 | CADE | A New Logic for Jointly Representing Hard and Soft Constraints. | Jan Maly, Stefan Woltran |
| 2018 | COMMA | Investigating Subclasses of Abstract Dialectical Frameworks. | Martin Diller, Atefeh Keshavarzi Zafarghandi, Thomas Linsbichler, Stefan Woltran |
| 2018 | COMMA | On the Expressive Power of Collective Attacks. | Wolfgang Dvork, Jorge Fandinno, Stefan Woltran |
| 2018 | COMMA | Evaluating SETAFs via Answer-Set Programming | Wolfgang Dvork, Alexander Greler, Stefan Woltran |
| 2018 | ESA | Weighted Model Counting on the GPU by Exploiting Small Treewidth. | Johannes Klaus Fichte, Markus Hecher, Stefan Woltran, Markus Zisser |
| 2018 | IJCAI | Single-Shot Epistemic Logic Program Solving. | Manuel Bichler, Michael Morak, Stefan Woltran |
| 2018 | IJCAI | Belief Update in the Horn Fragment. | Nadia Creignou, Adrian Haret, Odile Papini, Stefan Woltran |
| 2018 | IJCAI | Two Sides of the Same Coin: Belief Revision and Enforcing Arguments. | Adrian Haret, Johannes P. Wallner, Stefan Woltran |
| 2018 | IJCAI | Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving. | Thomas Linsbichler, Marco Maratea, Andreas Niskanen, Johannes P. Wallner, Stefan Woltran |
| 2018 | IJCAI | Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? | Jan Maly, Miroslaw Truszczynski, Stefan Woltran |
| 2018 | KR | Variable Elimination for DLP-Functions. | Ricardo Gonalves, Tomi Janhunen, Matthias Knorr, Joo Leite, Stefan Woltran |
| 2018 | SAT | Exploiting Treewidth for Projected Model Counting and Its Limits. | Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran |
| 2017 | AAAI | Solving Advanced Argumentation Problems with Answer-Set Programming. | Gerhard Brewka, Martin Diller, Georg Heissenberger, Thomas Linsbichler, Stefan Woltran |
| 2017 | BTW | Ranking Specific Sets of Objects. | Jan Maly, Stefan Woltran |
| 2017 | CPAIOR | htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond. | Michael Abseher, Nysret Musliu, Stefan Woltran |
| 2017 | IJCAI | A General Notion of Equivalence for Abstract Argumentation. | Ringo Baumann, Wolfgang Dvork, Thomas Linsbichler, Stefan Woltran |
| 2017 | IJCAI | The Impact of Treewidth on ASP Grounding and Solving. | Bernhard Bliem, Marius Moldovan, Michael Morak, Stefan Woltran |
| 2017 | IJCAI | On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks. | Markus Krll, Reinhard Pichler, Stefan Woltran |
| 2017 | KI | Deviation in Belief Change on Fragments of Propositional Logic. | Adrian Haret, Stefan Woltran |
| 2017 | LPNMR | Answer Set Solving with Bounded Treewidth Revisited. | Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran |
| 2017 | LPNMR | A Multiparametric View on Answer Set Programming. | Johannes Klaus Fichte, Martin Kronegger, Stefan Woltran |
| 2016 | AAAI | Subset Minimization in Dynamic Programming on Tree Decompositions. | Bernhard Bliem, Gnther Charwat, Markus Hecher, Stefan Woltran |
| 2016 | COMMA | Verifiability of Argumentation Semantics. | Ringo Baumann, Thomas Linsbichler, Stefan Woltran |
| 2016 | COMMA | On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions. | Bernhard Bliem, Markus Hecher, Stefan Woltran |
| 2016 | COMMA | Introducing the Second International Competition on Computational Models of Argumentation. | Sarah Alice Gaggl, Thomas Linsbichler, Marco Maratea, Stefan Woltran |
| 2016 | COMMA | GrappaVis - A System for Advanced Graph-Based Argumentation. | Georg Heissenberger, Stefan Woltran |
| 2016 | COMMA | Towards Advanced Systems for Abstract Argumentation. | Stefan Woltran |
| 2016 | ECAI | Clique-Width and Directed Width Measures for Answer-Set Programming. | Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran |
| 2016 | ECAI | Translation-Based Revision and Merging for Minimal Horn Reasoning. | Gerhard Brewka, Jean-Guy Mailly, Stefan Woltran |
| 2016 | ECAI | Beyond IC Postulates: Classification Criteria for Merging Operators. | Adrian Haret, Andreas Pfandler, Stefan Woltran |
| 2016 | IJCAI | ASP for Anytime Dynamic Programming on Tree Decompositions. | Bernhard Bliem, Benjamin Kaufmann, Torsten Schaub, Stefan Woltran |
| 2016 | IJCAI | Investigating the Relationship between Argumentation Semantics via Signatures. | Paul E. Dunne, Christof Spanring, Thomas Linsbichler, Stefan Woltran |
| 2016 | IJCAI | Distributing Knowledge into Simple Bases. | Adrian Haret, Jean-Guy Mailly, Stefan Woltran |
| 2016 | KI | Providing Built-In Counters in a Declarative Dynamic Programming Environment. | Michael Abseher, Marius Moldovan, Stefan Woltran |
| 2016 | KR | Merging of Abstract Argumentation Frameworks. | Jrme Delobelle, Adrian Haret, Sbastien Konieczny, Jean-Guy Mailly, Julien Rossit, Stefan Woltran |
| 2016 | KR | On the Functional Completeness of Argumentation Semantics. | Massimiliano Giacomin, Thomas Linsbichler, Stefan Woltran |
| 2016 | LOPSTR | lpopt: A Rule Optimization Tool for Answer Set Programming. | Manuel Bichler, Michael Morak, Stefan Woltran |
| 2016 | SAT | Dynamic Programming-based QBF Solving. | Gnther Charwat, Stefan Woltran |
| 2015 | IJCAI | Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning. | Michael Abseher, Frederico Dusberger, Nysret Musliu, Stefan Woltran |
| 2015 | IJCAI | An Extension-Based Approach to Belief Revision in Abstract Argumentation. | Martin Diller, Adrian Haret, Thomas Linsbichler, Stefan Rmmele, Stefan Woltran |
| 2015 | IJCAI | Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract). | Wolfgang Dvork, Matti Jrvisalo, Johannes Peter Wallner, Stefan Woltran |
| 2015 | IJCAI | Merging in the Horn Fragment. | Adrian Haret, Stefan Rmmele, Stefan Woltran |
| 2015 | IJCAI | On the Parameterized Complexity of Belief Revision. | Andreas Pfandler, Stefan Rmmele, Johannes Peter Wallner, Stefan Woltran |
| 2015 | KI | On the Functional Completeness of Argumentation Semantics. | Massimiliano Giacomin, Thomas Linsbichler, Stefan Woltran |
| 2015 | LPNMR | Shift Design with Answer Set Programming. | Michael Abseher, Martin Gebser, Nysret Musliu, Torsten Schaub, Stefan Woltran |
| 2015 | LPNMR | Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams. | Gnther Charwat, Stefan Woltran |
| 2015 | SYNASC | Dynamic Programming on Tree Decompositions in Practice - Some Lessons Learned. | Stefan Woltran |
| 2015 | WG | Complexity of Secure Sets. | Bernhard Bliem, Stefan Woltran |
| 2014 | COMMA | Reasoning in Abstract Dialectical Frameworks Using Quantified Boolean Formulas. | Martin Diller, Johannes Peter Wallner, Stefan Woltran |
| 2014 | COMMA | Resolution-Based Grounded Semantics Revisited. | Wolfgang Dvork, Thomas Linsbichler, Emilia Oikarinen, Stefan Woltran |
| 2014 | ECAI | Compact Argumentation Frameworks. | Ringo Baumann, Wolfgang Dvork, Thomas Linsbichler, Hannes Strass, Stefan Woltran |
| 2014 | ECAI | GRAPPA: A Semantical Framework for Graph-Based Argument Processing. | Gerhard Brewka, Stefan Woltran |
| 2014 | ECAI | Belief merging within fragments of propositional logic. | Nadia Creignou, Odile Papini, Stefan Rmmele, Stefan Woltran |
| 2014 | JELIA | The D-FLAT System for Dynamic Programming on Tree Decompositions. | Michael Abseher, Bernhard Bliem, Gnther Charwat, Frederico Dusberger, Markus Hecher, Stefan Woltran |
| 2014 | KR | Characteristics of Multiple Viewpoints in Abstract Argumentation. | Paul E. Dunne, Wolfgang Dvork, Thomas Linsbichler, Stefan Woltran |
| 2013 | AAAI | Abstract Preference Frameworks - a Unifying Perspective on Separability and Strong Equivalence. | Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran |
| 2013 | ECSQARU | Structural Properties for Deductive Argument Systems. | Anthony Hunter, Stefan Woltran |
| 2013 | IJCAI | Abstract Dialectical Frameworks Revisited. | Gerhard Brewka, Hannes Strass, Stefan Ellmauthaler, Johannes Peter Wallner, Stefan Woltran |
| 2013 | IJCAI | Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? | Nadia Creignou, Reinhard Pichler, Stefan Woltran |
| 2013 | LPNMR | ARVis: Visualizing Relations between Answer Sets. | Thomas Ambroz, Gnther Charwat, Andreas Jusits, Johannes Peter Wallner, Stefan Woltran |
| 2013 | LPNMR | AGM-Style Belief Revision of Logic Programs under Answer Set Semantics. | James P. Delgrande, Pavlos Peppas, Stefan Woltran |
| 2012 | COCOA | Multicut on Graphs of Bounded Clique-Width. | Martin Lackner, Reinhard Pichler, Stefan Rmmele, Stefan Woltran |
| 2012 | ICLP | Preprocessing of Complex Non-Ground Rules in Answer Set Programming. | Michael Morak, Stefan Woltran |
| 2012 | KR | Belief Revision within Fragments of Propositional Logic. | Nadia Creignou, Odile Papini, Reinhard Pichler, Stefan Woltran |
| 2012 | KR | Complexity-Sensitive Decision Procedures for Abstract Argumentation. | Wolfgang Dvork, Matti Jrvisalo, Johannes Peter Wallner, Stefan Woltran |
| 2012 | KR | Strong Equivalence of Qualitative Optimization Problems. | Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran |
| 2011 | ECSQARU | Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets. | Sarah Alice Gaggl, Stefan Woltran |
| 2011 | IJCAI | Relating the Semantics of Abstract Dialectical Frameworks and Standard AFs. | Gerhard Brewka, Paul E. Dunne, Stefan Woltran |
| 2011 | IJCAI | Parametric Properties of Ideal Semantics. | Wolfgang Dvork, Paul E. Dunne, Stefan Woltran |
| 2011 | ICTAI | A New Tree-Decomposition Based Algorithm for Answer Set Programming. | Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rmmele, Stefan Woltran |
| 2010 | AAAI | Representing Preferences Among Sets. | Gerhard Brewka, Miroslaw Truszczynski, Stefan Woltran |
| 2010 | CIAC | Multicut Algorithms via Tree Decompositions. | Reinhard Pichler, Stefan Rmmele, Stefan Woltran |
| 2010 | COMMA | Reasoning in Argumentation Frameworks of Bounded Clique-Width. | Wolfgang Dvork, Stefan Szeider, Stefan Woltran |
| 2010 | COMMA | cf2 Semantics Revisited. | Sarah Alice Gaggl, Stefan Woltran |
| 2010 | ECAI | The Complexity of Handling Minimal Solutions in Logic-Based Abduction. | Reinhard Pichler, Stefan Woltran |
| 2010 | JELIA | Sets of Boolean Connectives That Make Argumentation Easier. | Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran |
| 2010 | JELIA | A Dynamic-Programming Based ASP-Solver. | Michael Morak, Reinhard Pichler, Stefan Rmmele, Stefan Woltran |
| 2010 | KR | Abstract Dialectical Frameworks. | Gerhard Brewka, Stefan Woltran |
| 2010 | KR | Towards Fixed-Parameter Tractable Algorithms for Argumentation. | Wolfgang Dvork, Reinhard Pichler, Stefan Woltran |
| 2010 | KR | Characterizing Strong Equivalence for Argumentation Frameworks. | Emilia Oikarinen, Stefan Woltran |
| 2010 | KR | Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. | Reinhard Pichler, Stefan Rmmele, Stefan Szeider, Stefan Woltran |
| 2010 | LPAR | Counting and Enumeration Problems with Bounded Treewidth. | Reinhard Pichler, Stefan Rmmele, Stefan Woltran |
| 2009 | ICLP | Merging Logic Programs under Answer Set Semantics. | James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran |
| 2009 | IJCAI | Answer-Set Programming with Bounded Treewidth. | Michael Jakl, Reinhard Pichler, Stefan Woltran |
| 2009 | LPNMR | Manifold Answer-Set Programs for Meta-reasoning. | Wolfgang Faber, Stefan Woltran |
| 2009 | LPNMR | ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions. | Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran |
| 2009 | LPNMR | Belief Revision with Bounded Treewidth. | Reinhard Pichler, Stefan Rmmele, Stefan Woltran |
| 2009 | PPDP | Alternation as a programming paradigm. | Wolfgang Dvork, Georg Gottlob, Reinhard Pichler, Stefan Woltran |
| 2008 | AAAI | Hyperequivalence of Logic Programs with Respect to Supported Models. | Miroslaw Truszczynski, Stefan Woltran |
| 2008 | ICLP | ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming. | Uwe Egly, Sarah Alice Gaggl, Stefan Woltran |
| 2008 | ICLP | Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence. | Jrg Phrer, Hans Tompits, Stefan Woltran |
| 2008 | ICLP | Relativized Hyperequivalence of Logic Programs for Modular Programming. | Miroslaw Truszczynski, Stefan Woltran |
| 2008 | ISAIM | Hyperequivalence of Programs and Operators. | Miroslaw Truszczynski, Stefan Woltran |
| 2008 | KR | Belief Revision of Logic Programs under Answer Set Semantics. | James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran |
| 2008 | KR | Notions of Strong Equivalence for Logic Programs with Ordered Disjunction. | Wolfgang Faber, Hans Tompits, Stefan Woltran |
| 2008 | LPAR | Fast Counting with Bounded Treewidth. | Michael Jakl, Reinhard Pichler, Stefan Rmmele, Stefan Woltran |
| 2007 | AAAI | Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection. | Johannes Oetsch, Hans Tompits, Stefan Woltran |
| 2007 | IJCAI | Complexity Results for Checking Equivalence of Stratified Logic Programs. | Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran |
| 2007 | LPNMR | Debugging ASP Programs by Means of ASP. | Martin Brain, Martin Gebser, Jrg Phrer, Torsten Schaub, Hans Tompits, Stefan Woltran |
| 2007 | LPNMR | Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains. | Michael Fink, Reinhard Pichler, Hans Tompits, Stefan Woltran |
| 2007 | LPNMR | Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report. | Martin Gebser, Torsten Schaub, Hans Tompits, Stefan Woltran |
| 2007 | LPNMR | Modularity Aspects of Disjunctive Stable Models. | Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran |
| 2007 | LPNMR | Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report. | David Pearce, Hans Tompits, Stefan Woltran |
| 2007 | LPNMR | A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming. | Stefan Woltran |
| 2006 | COMMA | Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas. | Uwe Egly, Stefan Woltran |
| 2006 | ECAI | A Solver for QBFs in Nonprenex Form. | Uwe Egly, Martina Seidl, Stefan Woltran |
| 2006 | JELIA | An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs. | Thomas Eiter, Patrick Traxler, Stefan Woltran |
| 2006 | JELIA | ccT: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics. | Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran |
| 2006 | KR | Replacements in Non-Ground Answer-Set Programming. | Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran |
| 2005 | AAAI | Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case. | Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran |
| 2005 | ICLP | Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. | Hans Tompits, Stefan Woltran |
| 2005 | IJCAI | On Solution Correspondences in Answer-Set Programming. | Thomas Eiter, Hans Tompits, Stefan Woltran |
| 2004 | ICLP | On Acyclic and Head-Cycle Free Nested Logic Programs. | Thomas Linke, Hans Tompits, Stefan Woltran |
| 2004 | JELIA | Characterizations for Relativized Notions of Equivalence in Answer Set Programming. | Stefan Woltran |
| 2004 | KR | Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming. | Thomas Eiter, Wolfgang Faber, Michael Fink, Gerald Pfeifer, Stefan Woltran |
| 2004 | KR | On Eliminating Disjunctions in Stable Logic Programming. | Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran |
| 2004 | LPNMR | Simplifying Logic Programs Under Uniform and Strong Equivalence. | Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran |
| 2004 | LPNMR | nlp: A Compiler for Nested Logic Programming. | Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran |
| 2003 | ECSQARU | Paraconsistent Logics for Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories. | Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran |
| 2003 | SAT | Comparing Different Prenexing Strategies for Quantified Boolean Formulas. | Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda |
| 2002 | ICLP | A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report. | David Pearce, Vladimir Sarsakov, Torsten Schaub, Hans Tompits, Stefan Woltran |
| 2002 | JELIA | Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. | Philippe Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran |
| 2002 | TABLEAUX | Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks. | Thomas Eiter, Volker Klotz, Hans Tompits, Stefan Woltran |
| 2001 | ECSQARU | On Computing Solutions to Belief Change Scenarios. | James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran |
| 2001 | EPIA | Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. | David Pearce, Hans Tompits, Stefan Woltran |
| 2000 | AAAI | Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. | Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran |