Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. - Uwe Egly; Thomas Eiter; Hans Tompits; Stefan Woltran (AAAI/IAAI, 2000)

Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP. - Uwe Egly; Thomas Eiter; Volker Klotz; Hans Tompits; Stefan Woltran (WLP, 2000)

Implementing Default Reasoning Using Quantified Boolean Formulae. - Uwe Egly; Thomas Eiter; Hans Tompits; Stefan Woltran (WLP, 2000)

QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks - Uwe Egly; Thomas Eiter; Hans Tompits; Stefan Woltran (CoRR, 2000)

Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. - Uwe Egly; Thomas Eiter; Volker Klotz; Hans Tompits; Stefan Woltran (Answer Set Programming, 2001)

On Computing Solutions to Belief Change Scenarios. - James P. Delgrande; Torsten Schaub; Hans Tompits; Stefan Woltran (ECSQARU, 2001)

Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. - David Pearce 001; Hans Tompits; Stefan Woltran (EPIA, 2001)

A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report. - David Pearce 001; Vladimir Sarsakov; Torsten Schaub; Hans Tompits; Stefan Woltran (ICLP, 2002)

Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. - Philippe Besnard; Torsten Schaub; Hans Tompits; Stefan Woltran (Paraconsistent Computational Logic, 2002)

Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks. - Thomas Eiter; Volker Klotz; Hans Tompits; Stefan Woltran (TABLEAUX, 2002)

Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming. - Thomas Eiter; Wolfgang Faber 001; Michael Fink 001; Gerald Pfeifer; Stefan Woltran (Answer Set Programming, 2003)

Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation. - Thomas Eiter; Michael Fink 001; Hans Tompits; Stefan Woltran (Answer Set Programming, 2003)

Paraconsistent Logics for Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories. - Philippe Besnard; Torsten Schaub; Hans Tompits; Stefan Woltran (ECSQARU, 2003)

Comparing Different Prenexing Strategies for Quantified Boolean Formulas. - Uwe Egly; Martina Seidl; Hans Tompits; Stefan Woltran; Michael Zolda (SAT, 2003)

On Acyclic and Head-Cycle Free Nested Logic Programs. - Thomas Linke; Hans Tompits; Stefan Woltran (ICLP, 2004)

Characterizations for Relativized Notions of Equivalence in Answer Set Programming. - Stefan Woltran (JELIA, 2004)

Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming. - Thomas Eiter; Wolfgang Faber 001; Michael Fink 001; Gerald Pfeifer; Stefan Woltran (KR, 2004)

On Eliminating Disjunctions in Stable Logic Programming. - Thomas Eiter; Michael Fink 001; Hans Tompits; Stefan Woltran (KR, 2004)

Simplifying Logic Programs Under Uniform and Strong Equivalence. - Thomas Eiter; Michael Fink 001; Hans Tompits; Stefan Woltran (LPNMR, 2004)

nlp: A Compiler for Nested Logic Programming. - Vladimir Sarsakov; Torsten Schaub; Hans Tompits; Stefan Woltran (LPNMR, 2004)

On Computing Belief Change Operations using Quantified Boolean Formulas. - James P. Delgrande; Torsten Schaub; Hans Tompits; Stefan Woltran (J. Log. Comput., 2004)

Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case. - Thomas Eiter; Michael Fink 001; Hans Tompits; Stefan Woltran (AAAI, 2005)

Representing Paraconsistent Reasoning via Quantified Propositional Logic. - Philippe Besnard; Torsten Schaub; Hans Tompits; Stefan Woltran (Inconsistency Tolerance, 2005)

Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. - Hans Tompits; Stefan Woltran (ICLP, 2005)

On Solution Correspondences in Answer-Set Programming. - Thomas Eiter; Hans Tompits; Stefan Woltran (IJCAI, 2005)

On deciding subsumption problems. - Uwe Egly; Reinhard Pichler; Stefan Woltran (Ann. Math. Artif. Intell., 2005)

Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas. - Uwe Egly; Stefan Woltran (COMMA, 2006)

A Solver for QBFs in Nonprenex Form. - Uwe Egly; Martina Seidl; Stefan Woltran (ECAI, 2006)

An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs. - Thomas Eiter; Patrick Traxler; Stefan Woltran (JELIA, 2006)

ccT: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics. - Johannes Oetsch; Martina Seidl; Hans Tompits; Stefan Woltran (JELIA, 2006)

Replacements in Non-Ground Answer-Set Programming. - Thomas Eiter; Michael Fink 001; Hans Tompits; Patrick Traxler; Stefan Woltran (KR, 2006)

A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results. - Johannes Oetsch; Martina Seidl; Hans Tompits; Stefan Woltran (WLP, 2006)

Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection. - Johannes Oetsch; Hans Tompits; Stefan Woltran (AAAI, 2007)

Complexity Results for Checking Equivalence of Stratified Logic Programs. - Thomas Eiter; Michael Fink 001; Hans Tompits; Stefan Woltran (IJCAI, 2007)

Debugging ASP Programs by Means of ASP. - Martin Brain; Martin Gebser; Jörg Pührer; Torsten Schaub; Hans Tompits; Stefan Woltran (LPNMR, 2007)

Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains. - Michael Fink 001; Reinhard Pichler; Hans Tompits; Stefan Woltran (LPNMR, 2007)

Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report. - Martin Gebser; Torsten Schaub; Hans Tompits; Stefan Woltran (CENT, 2007)

Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report. - David Pearce 001; Hans Tompits; Stefan Woltran (CENT, 2007)

spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics. - Martin Gebser; Jörg Pührer; Torsten Schaub; Hans Tompits; Stefan Woltran (INAP/WLP, 2007)

Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT. - Johannes Oetsch; Martina Seidl; Hans Tompits; Stefan Woltran (INAP/WLP, 2007)

Complexity results for answer set programming with bounded predicate arities and implications. - Thomas Eiter; Wolfgang Faber 001; Michael Fink 001; Stefan Woltran (Ann. Math. Artif. Intell., 2007)

Semantical characterizations and complexity of equivalences in answer set programming. - Thomas Eiter; Michael Fink 001; Stefan Woltran (ACM Trans. Comput. Log., 2007)

dRDF: Entailment for Domain-Restricted RDF. - Reinhard Pichler; Axel Polleres; Fang Wei 001; Stefan Woltran (ESWC, 2008)

Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets. - Martin Gebser; Torsten Schaub; Hans Tompits; Stefan Woltran (FoIKS, 2008)

ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming. - Uwe Egly; Sarah Alice Gaggl; Stefan Woltran (ICLP, 2008)

Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence. - Jörg Pührer; Hans Tompits; Stefan Woltran (ICLP, 2008)

Hyperequivalence of Programs and Operators. - Miroslaw Truszczynski; Stefan Woltran (ISAIM, 2008)

Belief Revision of Logic Programs under Answer Set Semantics. - James P. Delgrande; Torsten Schaub; Hans Tompits; Stefan Woltran (KR, 2008)

Notions of Strong Equivalence for Logic Programs with Ordered Disjunction. - Wolfgang Faber 001; Hans Tompits; Stefan Woltran (KR, 2008)

Fast Counting with Bounded Treewidth. - Michael Jakl; Reinhard Pichler; Stefan Rümmele; Stefan Woltran (LPAR, 2008)

Hyperequivalence of logic programs with respect to supported models. - Miroslaw Truszczynski; Stefan Woltran (Ann. Math. Artif. Intell., 2008)

A common view on strong, uniform, and other notions of equivalence in answer-set programming. - Stefan Woltran (Theory Pract. Log. Program., 2008)

Merging Logic Programs under Answer Set Semantics. - James P. Delgrande; Torsten Schaub; Hans Tompits; Stefan Woltran (ICLP, 2009)

Answer-Set Programming with Bounded Treewidth. - Michael Jakl; Reinhard Pichler; Stefan Woltran (IJCAI, 2009)

Manifold Answer-Set Programs for Meta-reasoning. - Wolfgang Faber 001; Stefan Woltran (LPNMR, 2009)

ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions. - Johannes Oetsch; Martina Seidl; Hans Tompits; Stefan Woltran (LPNMR, 2009)

Belief Revision with Bounded Treewidth. - Reinhard Pichler; Stefan Rümmele; Stefan Woltran (LPNMR, 2009)

Alternation as a programming paradigm. - Wolfgang Dvorák; Georg Gottlob; Reinhard Pichler; Stefan Woltran (PPDP, 2009)

Encoding deductive argumentation in quantified Boolean formulae. - Philippe Besnard; Anthony Hunter; Stefan Woltran (Artif. Intell., 2009)

A solver for QBFs in negation normal form. - Uwe Egly; Martina Seidl; Stefan Woltran (Constraints An Int. J., 2009)

Characterising equilibrium logic and nested logic programs: Reductions and complexity - David Pearce 001; Hans Tompits; Stefan Woltran (CoRR, 2009)

A general approach to belief change in answer set programming - James P. Delgrande; Torsten Schaub; Hans Tompits; Stefan Woltran (CoRR, 2009)

Modularity Aspects of Disjunctive Stable Models. - Tomi Janhunen; Emilia Oikarinen; Hans Tompits; Stefan Woltran (J. Artif. Intell. Res., 2009)

Characterising equilibrium logic and nested logic programs: Reductions and complexity, . - David Pearce 001; Hans Tompits; Stefan Woltran (Theory Pract. Log. Program., 2009)

Relativized hyperequivalence of logic programs for modular programming. - Miroslaw Truszczynski; Stefan Woltran (Theory Pract. Log. Program., 2009)

Representing Preferences Among Sets. - Gerhard Brewka; Miroslaw Truszczynski; Stefan Woltran (AAAI, 2010)

Minimising RDF Graphs under Rules and Constraints Revisited. - Reinhard Pichler; Axel Polleres; Sebastian Skritek; Stefan Woltran (AMW, 2010)

Multicut Algorithms via Tree Decompositions. - Reinhard Pichler; Stefan Rümmele; Stefan Woltran (CIAC, 2010)

Strong Equivalence in Argumentation. - Stefan Woltran (CLIMA, 2010)

Reasoning in Argumentation Frameworks of Bounded Clique-Width. - Wolfgang Dvorák; Stefan Szeider; Stefan Woltran (COMMA, 2010)

cf2 Semantics Revisited. - Sarah Alice Gaggl; Stefan Woltran (COMMA, 2010)

Equivalence between Extended Datalog Programs - A Brief Survey. - Stefan Woltran (Datalog, 2010)

The Complexity of Handling Minimal Solutions in Logic-Based Abduction. - Reinhard Pichler; Stefan Woltran (ECAI, 2010)

Sets of Boolean Connectives That Make Argumentation Easier. - Nadia Creignou; Johannes Schmidt 001; Michael Thomas 001; Stefan Woltran (JELIA, 2010)

A Dynamic-Programming Based ASP-Solver. - Michael Morak; Reinhard Pichler; Stefan Rümmele; Stefan Woltran (JELIA, 2010)

Abstract Dialectical Frameworks. - Gerhard Brewka; Stefan Woltran (KR, 2010)

Towards Fixed-Parameter Tractable Algorithms for Argumentation. - Wolfgang Dvorák; Reinhard Pichler; Stefan Woltran (KR, 2010)

Counting and Enumeration Problems with Bounded Treewidth. - Reinhard Pichler; Stefan Rümmele; Stefan Woltran (LPAR (Dakar), 2010)

Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries. - Reinhard Pichler; Axel Polleres; Sebastian Skritek; Stefan Woltran (RR, 2010)

Answer-set programming encodings for argumentation frameworks. - Uwe Egly; Sarah Alice Gaggl; Stefan Woltran (Argument Comput., 2010)

Complexity of semi-stable and stage semantics in argumentation frameworks. - Wolfgang Dvorák; Stefan Woltran (Inf. Process. Lett., 2010)

Manifold Answer-Set Programs and Their Applications. - Wolfgang Faber 001; Stefan Woltran (Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, 2011)

Complexity of Super-Coherence Problems in Answer Set Programming. - Mario Alviano; Wolfgang Faber 001; Stefan Woltran (CILC, 2011)

Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets. - Sarah Alice Gaggl; Stefan Woltran (ECSQARU, 2011)

A New Tree-Decomposition Based Algorithm for Answer Set Programming. - Michael Morak; Nysret Musliu; Reinhard Pichler; Stefan Rümmele; Stefan Woltran (ICTAI, 2011)

Relating the Semantics of Abstract Dialectical Frameworks and Standard AFs. - Gerhard Brewka; Paul E. Dunne; Stefan Woltran (IJCAI, 2011)

Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems. - Wolfgang Dvorák; Sarah Alice Gaggl; Johannes Peter Wallner; Stefan Woltran (INAP/WLP, 2011)

dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation. - Wolfgang Dvorák; Michael Morak; Clemens Nopp; Stefan Woltran (INAP/WLP, 2011)

Characterizing strong equivalence for argumentation frameworks. - Emilia Oikarinen; Stefan Woltran (Artif. Intell., 2011)

Special issue on answer set programming. - Marcello Balduccini; Stefan Woltran (AI Commun., 2011)

Complexity of logic-based argumentation in Post's framework. - Nadia Creignou; Johannes Schmidt 001; Michael Thomas 001; Stefan Woltran (Argument Comput., 2011)

On the Intertranslatability of Argumentation Semantics. - Wolfgang Dvorák; Stefan Woltran (J. Artif. Intell. Res., 2011)

Parameterized Splitting: A Simple Modification-Based Approach. - Ringo Baumann; Gerhard Brewka; Wolfgang Dvorák; Stefan Woltran (Correct Reasoning, 2012)

Multicut on Graphs of Bounded Clique-Width. - Martin Lackner; Reinhard Pichler; Stefan Rümmele; Stefan Woltran (COCOA, 2012)

Preprocessing of Complex Non-Ground Rules in Answer Set Programming. - Michael Morak; Stefan Woltran (ICLP (Technical Communications), 2012)

Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming. - Michael Morak; Nysret Musliu; Reinhard Pichler; Stefan Rümmele; Stefan Woltran (LION, 2012)

Abstract Argumentation via Monadic Second Order Logic. - Wolfgang Dvorák; Stefan Szeider; Stefan Woltran (SUM, 2012)

Towards fixed-parameter tractable algorithms for abstract argumentation. - Wolfgang Dvorák; Reinhard Pichler; Stefan Woltran (Artif. Intell., 2012)

D-FLAT: Declarative problem solving using tree decompositions and answer-set programming. - Bernhard Bliem; Michael Morak; Stefan Woltran (Theory Pract. Log. Program., 2012)

Abstract Preference Frameworks - a Unifying Perspective on Separability and Strong Equivalence. - Wolfgang Faber 001; Miroslaw Truszczynski; Stefan Woltran (AAAI, 2013)

Admissibility in the Abstract Dialectical Framework. - Sylwia Polberg; Johannes Peter Wallner; Stefan Woltran (CLIMA, 2013)

Advanced SAT Techniques for Abstract Argumentation. - Johannes Peter Wallner; Georg Weissenbacher; Stefan Woltran (CLIMA, 2013)

Structural Properties for Deductive Argument Systems. - Anthony Hunter; Stefan Woltran (ECSQARU, 2013)

Abstract Dialectical Frameworks Revisited. - Gerhard Brewka; Hannes Strass; Stefan Ellmauthaler; Johannes Peter Wallner; Stefan Woltran (IJCAI, 2013)

Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem. - Bernhard Bliem; Reinhard Pichler; Stefan Woltran (IPEC, 2013)

ARVis: Visualizing Relations between Answer Sets. - Thomas Ambroz; Günther Charwat; Andreas Jusits; Johannes Peter Wallner; Stefan Woltran (LPNMR, 2013)

AGM-Style Belief Revision of Logic Programs under Answer Set Semantics. - James P. Delgrande; Pavlos Peppas; Stefan Woltran (LPNMR, 2013)

Parametric properties of ideal semantics. - Paul E. Dunne; Wolfgang Dvorák; Stefan Woltran (Artif. Intell., 2013)

Utilizing ASP for Generating and Visualizing Argumentation Frameworks - Günther Charwat; Johannes Peter Wallner; Stefan Woltran (CoRR, 2013)

Strong Equivalence of Qualitative Optimization Problems. - Wolfgang Faber 001; Miroslaw Truszczynski; Stefan Woltran (J. Artif. Intell. Res., 2013)

Model-based recasting in answer-set programming. - Thomas Eiter; Michael Fink 001; Jörg Pührer; Hans Tompits; Stefan Woltran (J. Appl. Non Class. Logics, 2013)

The cf2 argumentation semantics revisited. - Sarah Alice Gaggl; Stefan Woltran (J. Log. Comput., 2013)

Complexity of redundancy detection on RDF graphs in the presence of rules, constraints, and queries. - Reinhard Pichler; Axel Polleres; Sebastian Skritek; Stefan Woltran (Semantic Web, 2013)

A Model-Theoretic Approach to Belief Change in Answer Set Programming. - James P. Delgrande; Torsten Schaub; Hans Tompits; Stefan Woltran (ACM Trans. Comput. Log., 2013)

Resolution-Based Grounded Semantics Revisited. - Wolfgang Dvorák; Thomas Linsbichler; Emilia Oikarinen; Stefan Woltran (COMMA, 2014)

Compact Argumentation Frameworks. - Ringo Baumann; Wolfgang Dvorák; Thomas Linsbichler; Hannes Strass; Stefan Woltran (ECAI, 2014)

GRAPPA: A Semantical Framework for Graph-Based Argument Processing. - Gerhard Brewka; Stefan Woltran (ECAI, 2014)

The D-FLAT System for Dynamic Programming on Tree Decompositions. - Michael Abseher; Bernhard Bliem; Günther Charwat; Frederico Dusberger; Markus Hecher; Stefan Woltran (JELIA, 2014)

Probabilistic Argumentation Frameworks - A Logical Approach. - Dragan Doder; Stefan Woltran (SUM, 2014)

Complexity-sensitive decision procedures for abstract argumentation. - Wolfgang Dvorák; Matti Järvisalo; Johannes Peter Wallner; Stefan Woltran (Artif. Intell., 2014)

Generalizations of Dung Frameworks and Their Role in Formal Argumentation. - Gerhard Brewka; Sylwia Polberg; Stefan Woltran (IEEE Intell. Syst., 2014)

Belief revision within fragments of propositional logic. - Nadia Creignou; Odile Papini; Reinhard Pichler; Stefan Woltran (J. Comput. Syst. Sci., 2014)

Complexity of super-coherence problems in ASP. - Mario Alviano; Wolfgang Faber 001; Stefan Woltran (Theory Pract. Log. Program., 2014)

Tractable answer-set programming with weight constraints: bounded treewidth is not enough. - Reinhard Pichler; Stefan Rümmele; Stefan Szeider; Stefan Woltran (Theory Pract. Log. Program., 2014)

A Glimpse on Gerhard Brewka's Contributions to Artificial Intelligence. - Thomas Eiter; Hannes Strass; Miroslaw Truszczynski; Stefan Woltran (Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation, 2015)

Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning. - Michael Abseher; Frederico Dusberger; Nysret Musliu; Stefan Woltran (IJCAI, 2015)

Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract). - Wolfgang Dvorák; Matti Järvisalo; Johannes Peter Wallner; Stefan Woltran (IJCAI, 2015)

On the Parameterized Complexity of Belief Revision. - Andreas Pfandler; Stefan Rümmele; Johannes Peter Wallner; Stefan Woltran (IJCAI, 2015)

On the Functional Completeness of Argumentation Semantics. - Massimiliano Giacomin; Thomas Linsbichler; Stefan Woltran (DKB/KIK@KI, 2015)

Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams. - Günther Charwat; Stefan Woltran (LPNMR, 2015)

Dynamic Programming on Tree Decompositions in Practice - Some Lessons Learned. - Stefan Woltran (SYNASC, 2015)

The Hidden Power of Abstract Argumentation Semantics. - Thomas Linsbichler; Christof Spanring; Stefan Woltran (TAFA, 2015)

Methods for solving reasoning problems in abstract argumentation - A survey. - Günther Charwat; Wolfgang Dvorák; Sarah Alice Gaggl; Johannes Peter Wallner; Stefan Woltran (Artif. Intell., 2015)

Characteristics of multiple viewpoints in abstract argumentation. - Paul E. Dunne; Wolfgang Dvorák; Thomas Linsbichler; Stefan Woltran (Artif. Intell., 2015)

Reasoning in abstract dialectical frameworks using quantified Boolean formulas. - Martin Diller; Johannes Peter Wallner; Stefan Woltran (Argument Comput., 2015)

Applications of logical approaches to argumentation. - João Leite 001; Tran Cao Son; Paolo Torroni; Stefan Woltran (Argument Comput., 2015)

The complexity of handling minimal solutions in logic-based abduction. - Andreas Pfandler; Reinhard Pichler; Stefan Woltran (J. Log. Comput., 2015)

Dual-normal logic programs - the forgotten class. - Johannes Klaus Fichte; Miroslaw Truszczynski; Stefan Woltran (Theory Pract. Log. Program., 2015)

Improved answer-set programming encodings for abstract argumentation. - Sarah Alice Gaggl; Norbert Manthey; Alessandro Ronca; Johannes Peter Wallner; Stefan Woltran (Theory Pract. Log. Program., 2015)

Subset Minimization in Dynamic Programming on Tree Decompositions. - Bernhard Bliem; Günther Charwat; Markus Hecher; Stefan Woltran (AAAI Workshop: Beyond NP, 2016)

Verifiability of Argumentation Semantics. - Ringo Baumann; Thomas Linsbichler; Stefan Woltran (COMMA, 2016)

On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions. - Bernhard Bliem; Markus Hecher; Stefan Woltran (COMMA, 2016)

Introducing the Second International Competition on Computational Models of Argumentation. - Sarah Alice Gaggl; Thomas Linsbichler; Marco Maratea; Stefan Woltran (SAFA@COMMA, 2016)

GrappaVis - A System for Advanced Graph-Based Argumentation. - Georg Heissenberger; Stefan Woltran (COMMA, 2016)

Towards Advanced Systems for Abstract Argumentation. - Stefan Woltran (SAFA@COMMA, 2016)

Clique-Width and Directed Width Measures for Answer-Set Programming. - Bernhard Bliem; Sebastian Ordyniak; Stefan Woltran (ECAI, 2016)

Translation-Based Revision and Merging for Minimal Horn Reasoning. - Gerhard Brewka; Jean-Guy Mailly; Stefan Woltran (ECAI, 2016)

Beyond IC Postulates: Classification Criteria for Merging Operators. - Adrian Haret; Andreas Pfandler; Stefan Woltran (ECAI, 2016)

ASP for Anytime Dynamic Programming on Tree Decompositions. - Bernhard Bliem; Benjamin Kaufmann; Torsten Schaub; Stefan Woltran (IJCAI, 2016)

Investigating the Relationship between Argumentation Semantics via Signatures. - Paul E. Dunne; Christof Spanring; Thomas Linsbichler; Stefan Woltran (IJCAI, 2016)

Distributing Knowledge into Simple Bases. - Adrian Haret; Jean-Guy Mailly; Stefan Woltran (IJCAI, 2016)

Providing Built-In Counters in a Declarative Dynamic Programming Environment. - Michael Abseher; Marius Moldovan; Stefan Woltran (KI, 2016)

Merging of Abstract Argumentation Frameworks. - Jérôme Delobelle; Adrian Haret; Sébastien Konieczny; Jean-Guy Mailly; Julien Rossit; Stefan Woltran (KR, 2016)

Dynamic Programming-based QBF Solving. - Günther Charwat; Stefan Woltran (QBF@SAT, 2016)

On rejected arguments and implicit conflicts: The hidden power of argumentation semantics. - Ringo Baumann; Wolfgang Dvorák; Thomas Linsbichler; Christof Spanring; Hannes Strass; Stefan Woltran (Artif. Intell., 2016)

Counting Answer Sets via Dynamic Programming. - Johannes Klaus Fichte; Markus Hecher; Michael Morak; Stefan Woltran (CoRR, 2016)

Shift Design with Answer Set Programming. - Michael Abseher; Martin Gebser; Nysret Musliu; Torsten Schaub; Stefan Woltran (Fundam. Informaticae, 2016)

D-FLAT2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy. - Bernhard Bliem; Günther Charwat; Markus Hecher; Stefan Woltran (Fundam. Informaticae, 2016)

The role of self-attacking arguments in characterizations of equivalence notions. - Ringo Baumann; Stefan Woltran (J. Log. Comput., 2016)

Belief Merging within Fragments of Propositional Logic. - Nadia Creignou; Odile Papini; Stefan Rümmele; Stefan Woltran (ACM Trans. Comput. Log., 2016)

The power of non-ground rules in Answer Set Programming. - Manuel Bichler; Michael Morak; Stefan Woltran (Theory Pract. Log. Program., 2016)

htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond. - Michael Abseher; Nysret Musliu; Stefan Woltran (CPAIOR, 2017)

The Impact of Treewidth on ASP Grounding and Solving. - Bernhard Bliem; Marius Moldovan; Michael Morak; Stefan Woltran (IJCAI, 2017)

On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks. - Markus Kröll; Reinhard Pichler; Stefan Woltran (IJCAI, 2017)

Deviation in Belief Change on Fragments of Propositional Logic. - Adrian Haret; Stefan Woltran (DKB/KIK@KI, 2017)

Answer Set Solving with Bounded Treewidth Revisited. - Johannes Klaus Fichte; Markus Hecher; Michael Morak; Stefan Woltran (LPNMR, 2017)

Ranking Specific Sets of Objects. - Jan Maly 001; Stefan Woltran (Datenbank-Spektrum, 2017)

Abstract Dialectical Frameworks. An Overview. - Gerhard Brewka; Stefan Ellmauthaler; Hannes Strass; Johannes Peter Wallner; Stefan Woltran (FLAP, 2017)

Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning. - Michael Abseher; Nysret Musliu; Stefan Woltran (J. Artif. Intell. Res., 2017)

Implementing Courcelle's Theorem in a declarative framework for dynamic programming. - Bernhard Bliem; Reinhard Pichler; Stefan Woltran (J. Log. Comput., 2017)

Merging in the Horn Fragment. - Adrian Haret; Stefan Rümmele; Stefan Woltran (ACM Trans. Comput. Log., 2017)

When you must forget: Beyond strong persistence when forgetting in answer set programming. - Ricardo Gonçalves 001; Matthias Knorr 001; João Leite 001; Stefan Woltran (Theory Pract. Log. Program., 2017)

Weighted Abstract Dialectical Frameworks. - Gerhard Brewka; Hannes Strass; Johannes Peter Wallner; Stefan Woltran (AAAI, 2018)

A New Logic for Jointly Representing Hard and Soft Constraints. - Jan Maly 001; Stefan Woltran (PRUV@IJCAR, 2018)

Evaluating SETAFs via Answer-Set Programming - Wolfgang Dvorák; Alexander Greßler; Stefan Woltran (SAFA@COMMA, 2018)

Weighted Model Counting on the GPU by Exploiting Small Treewidth. - Johannes Klaus Fichte; Markus Hecher; Stefan Woltran; Markus Zisser (ESA, 2018)

Single-Shot Epistemic Logic Program Solving. - Manuel Bichler; Michael Morak; Stefan Woltran (IJCAI, 2018)

Belief Update in the Horn Fragment. - Nadia Creignou; Adrian Haret; Odile Papini; Stefan Woltran (IJCAI, 2018)

Two Sides of the Same Coin: Belief Revision and Enforcing Arguments. - Adrian Haret; Johannes Peter Wallner; Stefan Woltran (IJCAI, 2018)

Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving. - Thomas Linsbichler; Marco Maratea; Andreas Niskanen; Johannes Peter Wallner; Stefan Woltran (IJCAI, 2018)

Variable Elimination for DLP-Functions. - Ricardo Gonçalves 001; Tomi Janhunen; Matthias Knorr 001; João Leite 001; Stefan Woltran (KR, 2018)

Exploiting Treewidth for Projected Model Counting and Its Limits. - Johannes Klaus Fichte; Markus Hecher; Michael Morak; Stefan Woltran (SAT, 2018)

Summary Report of the Second International Competition on Computational Models of Argumentation. - Sarah Alice Gaggl; Thomas Linsbichler; Marco Maratea; Stefan Woltran (AI Mag., 2018)

Complexity of Secure Sets. - Bernhard Bliem; Stefan Woltran (Algorithmica, 2018)

Equivalence between answer-set programs under (partially) fixed input. - Bernhard Bliem; Stefan Woltran (Ann. Math. Artif. Intell., 2018)

Abstract solvers for Dung's argumentation frameworks. - Rémi Brochenin; Thomas Linsbichler; Marco Maratea; Johannes Peter Wallner; Stefan Woltran (Argument Comput., 2018)

Weighted Abstract Dialectical Frameworks: Extended and Revised Report. - Gerhard Brewka; Jörg Pührer; Hannes Strass; Johannes Peter Wallner; Stefan Woltran (CoRR, 2018)

Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version). - Wolfgang Faber 001; Michael Morak; Stefan Woltran (CoRR, 2018)

Defensive alliances in graphs of bounded treewidth. - Bernhard Bliem; Stefan Woltran (Discret. Appl. Math., 2018)

An extension-based approach to belief revision in abstract argumentation. - Martin Diller; Adrian Haret; Thomas Linsbichler; Stefan Rümmele; Stefan Woltran (Int. J. Approx. Reason., 2018)

General Belief Revision. - James P. Delgrande; Pavlos Peppas; Stefan Woltran (J. ACM, 2018)

Dynamic Programming on Tree Decompositions with D-FLAT. - Michael Abseher; Bernhard Bliem; Markus Hecher; Marius Moldovan; Stefan Woltran (Künstliche Intell., 2018)

Interview with Gerhard Brewka. - Gerhard Brewka; Torsten Schaub; Stefan Woltran (Künstliche Intell., 2018)

Interview with Vladimir Lifschitz. - Vladimir Lifschitz; Torsten Schaub; Stefan Woltran (Künstliche Intell., 2018)

Special Issue on Answer Set Programming. - Torsten Schaub; Stefan Woltran (Künstliche Intell., 2018)

Answer set programming unleashed! - Torsten Schaub; Stefan Woltran (Künstliche Intell., 2018)

Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? - Nadia Creignou; Reinhard Pichler; Stefan Woltran (Log. Methods Comput. Sci., 2018)

Preface to the Special Issue on Computational Logic in Multi-Agent Systems (CLIMA XIV). - João Leite 001; Tran Cao Son; Paolo Torroni; Stefan Woltran (J. Log. Comput., 2018)

Forgetting in Modular Answer Set Programming. - Ricardo Gonçalves 001; Tomi Janhunen; Matthias Knorr 001; João Leite 001; Stefan Woltran (AAAI, 2019)

Strong Equivalence for Epistemic Logic Programs Made Easy. - Wolfgang Faber 001; Michael Morak; Stefan Woltran (AAAI, 2019)

Belief Revision Operators with Varying Attitudes Towards Initial Beliefs. - Adrian Haret; Stefan Woltran (IJCAI, 2019)

Multi-valued GRAPPA. - Gerhard Brewka; Jörg Pührer; Stefan Woltran (JELIA, 2019)

Preprocessing Argumentation Frameworks via Replacement Patterns. - Wolfgang Dvorák; Matti Järvisalo; Thomas Linsbichler; Andreas Niskanen; Stefan Woltran (JELIA, 2019)

Strong Equivalence for Argumentation Frameworks with Collective Attacks. - Wolfgang Dvorák; Anna Rapberger; Stefan Woltran (KI, 2019)

A general notion of equivalence for abstract argumentation. - Ringo Baumann; Wolfgang Dvorák; Thomas Linsbichler; Stefan Woltran (Artif. Intell., 2019)

Preface. - Flavio Ferrarotti; Stefan Woltran (Ann. Math. Artif. Intell., 2019)

A multiparametric view on answer set programming. - Johannes Klaus Fichte; Martin Kronegger; Stefan Woltran (Ann. Math. Artif. Intell., 2019)

On the expressive power of collective attacks. - Wolfgang Dvorák; Jorge Fandinno; Stefan Woltran (Argument Comput., 2019)

Expansion-based QBF Solving on Tree Decompositions. - Günther Charwat; Stefan Woltran (Fundam. Informaticae, 2019)

Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? - Jan Maly 001; Miroslaw Truszczynski; Stefan Woltran (J. Artif. Intell. Res., 2019)

On Uniform Equivalence of Epistemic Logic Programs. - Wolfgang Faber 001; Michael Morak; Stefan Woltran (Theory Pract. Log. Program., 2019)

Computational Argumentation - Formal Models and Complexity Results (invited talk). - Stefan Woltran (CILC, 2020)

Ranking-Based Semantics from the Perspective of Claims. - Stefano Bistarelli; Wolfgang Dvorák; Carlo Taticchi; Stefan Woltran (COMMA, 2020)

The ASPARTIX System Suite. - Wolfgang Dvorák; Sarah Alice Gaggl; Anna Rapberger; Johannes Peter Wallner; Stefan Woltran (COMMA, 2020)

On the Relation Between Claim-Augmented Argumentation Frameworks and Collective Attacks. - Wolfgang Dvorák; Anna Rapberger; Stefan Woltran (ECAI, 2020)

Explaining Non-Acceptability in Abstract Argumentation. - Zeynep G. Saribatur; Johannes Peter Wallner; Stefan Woltran (ECAI, 2020)

ASPARTIX-V19 - An Answer-Set Programming Based System for Abstract Argumentation. - Wolfgang Dvorák; Anna Rapberger; Johannes Peter Wallner; Stefan Woltran (FoIKS, 2020)

Encoding Choice Logics in ASP. - Michael Bernreiter; Jan Maly 001; Stefan Woltran (ICLP Workshops, 2020)

Structural Decompositions of Epistemic Logic Programs. - Markus Hecher; Michael Morak; Stefan Woltran (ICLP Workshops, 2020)

Argumentation Semantics under a Claim-centric View: Properties, Expressiveness and Relation to SETAFs. - Wolfgang Dvorák; Anna Rapberger; Stefan Woltran (KR, 2020)

Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology. - Markus Hecher; Patrick Thier; Stefan Woltran (SAT, 2020)

Complexity of abstract argumentation under a claim-centric view. - Wolfgang Dvorák; Stefan Woltran (Artif. Intell., 2020)

Design and results of the Second International Competition on Computational Models of Argumentation. - Sarah Alice Gaggl; Thomas Linsbichler; Marco Maratea; Stefan Woltran (Artif. Intell., 2020)

On the limits of forgetting in Answer Set Programming. - Ricardo Gonçalves 001; Matthias Knorr 001; João Leite 001; Stefan Woltran (Artif. Intell., 2020)

Investigating subclasses of abstract dialectical frameworks. - Martin Diller; Atefeh Keshavarzi Zafarghandi; Thomas Linsbichler; Stefan Woltran (Argument Comput., 2020)

lpopt: A Rule Optimization Tool for Answer Set Programming. - Manuel Bichler; Michael Morak; Stefan Woltran (Fundam. Informaticae, 2020)

The Impact of Treewidth on Grounding and Solving of Answer Set Programs. - Bernhard Bliem; Michael Morak; Marius Moldovan; Stefan Woltran (J. Artif. Intell. Res., 2020)

Computing secure sets in graphs using answer set programming. - Michael Abseher; Bernhard Bliem; Günther Charwat; Frederico Dusberger; Stefan Woltran (J. Log. Comput., 2020)

On the different types of collective attacks in abstract argumentation: equivalence results for SETAFs. - Wolfgang Dvorák; Anna Rapberger; Stefan Woltran (J. Log. Comput., 2020)

selp: A Single-Shot Epistemic Logic Program Solver. - Manuel Bichler; Michael Morak; Stefan Woltran (Theory Pract. Log. Program., 2020)

Solving Advanced Argumentation Problems with Answer Set Programming. - Gerhard Brewka; Martin Diller; Georg Heissenberger; Thomas Linsbichler; Stefan Woltran (Theory Pract. Log. Program., 2020)

Graph-Classes of Argumentation Frameworks with Collective Attacks. - Wolfgang Dvorák; Matthias König 002; Stefan Woltran (JELIA, 2021)

On the Complexity of Preferred Semantics in Argumentation Frameworks with Bounded Cycle Length. - Wolfgang Dvorák; Matthias König 002; Stefan Woltran (KR, 2021)

DynASP2.5: Dynamic Programming on Tree Decompositions in Action. - Johannes Klaus Fichte; Markus Hecher; Michael Morak; Stefan Woltran (Algorithms, 2021)

Aspartix-V21. - Wolfgang Dvorák; Matthias König 002; Johannes Peter Wallner; Stefan Woltran (CoRR, 2021)

Beyond Uniform Equivalence between Answer-set Programs. - Johannes Oetsch; Martina Seidl; Hans Tompits; Stefan Woltran (ACM Trans. Comput. Log., 2021)

Preface. - Marcello Balduccini; Yuliya Lierler; Stefan Woltran (Theory Pract. Log. Program., 2021)

Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs. - Viktor Besin; Markus Hecher; Stefan Woltran (Theory Pract. Log. Program., 2021)

It Is Simple, It Is Complicated. - Julia Neidhardt; Hannes Werthner; Stefan Woltran (Perspectives on Digital Humanism, 2022)

Tractable Abstract Argumentation via Backdoor-Treewidth. - Wolfgang Dvorák; Markus Hecher; Matthias König 002; André Schidler; Stefan Szeider; Stefan Woltran (AAAI, 2022)

Treewidth for Argumentation Frameworks with Collective Attacks. - Wolfgang Dvorák; Matthias König 002; Stefan Woltran (COMMA, 2022)

Deletion-Backdoors for Argumentation Frameworks with Collective Attacks. - Wolfgang Dvorák; Matthias König 002; Stefan Woltran (SAFA@COMMA, 2022)

Non-Admissibility in Abstract Argumentation. - Wolfgang Dvorák; Tjitze Rienstra; Leendert van der Torre; Stefan Woltran (COMMA, 2022)

Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck. - Viktor Besin; Markus Hecher; Stefan Woltran (IJCAI, 2022)

Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Extended Abstract). - Viktor Besin; Markus Hecher; Stefan Woltran (IJCAI, 2022)

Rediscovering Argumentation Principles Utilizing Collective Attacks. - Wolfgang Dvorák; Matthias König 002; Markus Ulbricht 001; Stefan Woltran (KR, 2022)

Choice logics and their computational properties. - Michael Bernreiter; Jan Maly 001; Stefan Woltran (Artif. Intell., 2022)

Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving. - Thomas Linsbichler; Marco Maratea; Andreas Niskanen; Johannes Peter Wallner; Stefan Woltran (Artif. Intell., 2022)

Comparing the Reasoning Capabilities of Equilibrium Theories and Answer Set Programs. - Jorge Fandinno; David Pearce 001; Concepción Vidal; Stefan Woltran (Algorithms, 2022)

Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility. - Wolfgang Dvorák; Markus Ulbricht 001; Stefan Woltran (J. Artif. Intell. Res., 2022)

Exploiting Database Management Systems and Treewidth for Counting. - Johannes Klaus Fichte; Markus Hecher; Patrick Thier; Stefan Woltran (Theory Pract. Log. Program., 2022)

Grounding Planning Tasks Using Tree Decompositions and Iterated Solving. - Augusto B. Corrêa; Markus Hecher; Malte Helmert; Davide Mario Longo; Florian Pommerening; Stefan Woltran (ICAPS, 2023)

On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth. - Viktor Besin; Markus Hecher; Stefan Woltran (ECAI, 2023)

Foundations for Projecting Away the Irrelevant in ASP Programs. - Zeynep G. Saribatur; Stefan Woltran (KR, 2023)

Sets Attacking Sets in Abstract Argumentation. - Yannis Dimopoulos; Wolfgang Dvorák; Matthias König 002; Anna Rapberger; Markus Ulbricht 001; Stefan Woltran (NMR, 2023)

Digital Humanism and Norms in Recommender Systems. - Erich Prem; Julia Neidhardt; Peter Knees; Stefan Woltran; Hannes Werthner (NORMalize@RecSys, 2023)

Solving Projected Model Counting by Utilizing Treewidth and its Limits. - Johannes Klaus Fichte; Markus Hecher; Michael Morak; Patrick Thier; Stefan Woltran (Artif. Intell., 2023)

The complexity landscape of claim-augmented argumentation frameworks. - Wolfgang Dvorák; Alexander Greßler; Anna Rapberger; Stefan Woltran (Artif. Intell., 2023)

Expressiveness of SETAFs and support-free ADFs under 3-valued semantics. - Wolfgang Dvorák; Atefeh Keshavarzi Zafarghandi; Stefan Woltran (J. Appl. Non Class. Logics, 2023)

A claim-centric perspective on abstract argumentation semantics: Claim-defeat, principles, and expressiveness. - Wolfgang Dvorák; Anna Rapberger; Stefan Woltran (Artif. Intell., 2023)

Redefining ABA+ Semantics via Abstract Set-to-Set Attacks. - Yannis Dimopoulos; Wolfgang Dvorák; Matthias König 002; Anna Rapberger; Markus Ulbricht 001; Stefan Woltran (AAAI, 2024)

A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming. - Zeynep G. Saribatur; Stefan Woltran (AAAI, 2024)

Combining Voting and Abstract Argumentation to Understand Online Discussions. - Michael Bernreiter; Jan Maly 001; Oliviero Nardi; Stefan Woltran (AAMAS, 2024)

Splitting Argumentation Frameworks with Collective Attacks. - Giovanni Buraglio; Wolfgang Dvorák; Matthias König 002; Stefan Woltran (SAFA@COMMA, 2024)

The GSAF Solver and Verifier. - Alexander Greßler; Wolfgang Dvorák; Stefan Woltran (COMMA, 2024)

Constrained Derivation in Assumption-Based Argumentation. - Giovanni Buraglio; Wolfgang Dvorák; Anna Rapberger; Stefan Woltran (FoIKS, 2024)

Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting. - Alexander Beiser; Markus Hecher; Kaan Unalan; Stefan Woltran (IJCAI, 2024)

Epistemic Logic Programs: Non-Ground and Counting Complexity. - Thomas Eiter; Johannes Klaus Fichte; Markus Hecher; Stefan Woltran (IJCAI, 2024)

Equipping Abstract Argumentation Solvers for Verifying Negative Results. - Wolfgang Dvorák; Alexander Greßler; Stefan Woltran (SAC, 2024)

Abstract argumentation with conditional preferences. - Michael Bernreiter; Wolfgang Dvorák; Stefan Woltran (Argument Comput., 2024)

Visualizing Extensions of Argumentation Frameworks as Layered Graphs. - Martin Nöllenburg; Christian Pirker; Anna Rapberger; Stefan Woltran; Jules Wulms (CoRR, 2024)

The Effect of Preferences in Abstract Argumentation under a Claim-Centric View. - Michael Bernreiter; Wolfgang Dvorák; Anna Rapberger; Stefan Woltran (J. Artif. Intell. Res., 2024)

Principles and their Computational Consequences for Argumentation Frameworks with Collective Attacks. - Wolfgang Dvorák; Matthias König 002; Markus Ulbricht 001; Stefan Woltran (J. Artif. Intell. Res., 2024)

Supplementary Material for "Combining Voting and Abstract Argumentation to Understand Online Discussions". - Michael Bernreiter; Jan Maly 001; Oliviero Nardi; Stefan Woltran (Zenodo, 2024)

Sequent Calculi for Choice Logics. - Michael Bernreiter; Anela Lolic; Jan Maly 001; Stefan Woltran (J. Autom. Reason., 2024)

Parameterized complexity of abstract argumentation with collective attacks. - Wolfgang Dvorák; Matthias König 002; Stefan Woltran (Argument Comput., 2025)

Understanding Verbatim Memorization in LLMs Through Circuit Discovery. - Ilya Lasy; Peter Knees; Stefan Woltran (CoRR, 2025)

Automated Hybrid Grounding Using Structural and Data-Driven Heuristics. - Alexander Beiser; Markus Hecher; Stefan Woltran (CoRR, 2025)