Woltran, Stefan

56 publications

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

IJCAI 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

JAIR 2024 Principles and Their Computational Consequences for Argumentation Frameworks with Collective Attacks Wolfgang Dvorák, Matthias König, Markus Ulbricht, Stefan Woltran

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

JAIR 2024 The Effect of Preferences in Abstract Argumentation Under a Claim-Centric View Michael Bernreiter, Wolfgang Dvorák, Anna Rapberger, Stefan Woltran

AAAI 2023 The Effect of Preferences in Abstract Argumentation Under a Claim-Centric View Michael Bernreiter, Wolfgang Dvorák, Anna Rapberger, Stefan Woltran

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

JAIR 2022 Recursion in Abstract Argumentation Is Hard - On the Complexity of Semantics Based on Weak Admissibility Wolfgang Dvorák, Markus Ulbricht, Stefan Woltran

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

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

IJCAI 2021 Choice Logics and Their Computational Properties Michael Bernreiter, Jan Maly, Stefan Woltran

AAAI 2021 Recursion in Abstract Argumentation Is Hard - On the Complexity of Semantics Based on Weak Admissibility Wolfgang Dvorák, Markus Ulbricht, Stefan Woltran

AAAI 2021 The Complexity Landscape of Claim-Augmented Argumentation Frameworks Wolfgang Dvorák, Alexander Greßler, Anna Rapberger, Stefan Woltran

AAAI 2020 Structural Decompositions of Epistemic Logic Programs Markus Hecher, Michael Morak, Stefan Woltran

JAIR 2020 The Impact of Treewidth on Grounding and Solving of Answer Set Programs Bernhard Bliem, Michael Morak, Marius Moldovan, Stefan Woltran

IJCAI 2019 Belief Revision Operators with Varying Attitudes Towards Initial Beliefs Adrian Haret, Stefan Woltran

AAAI 2019 Complexity of Abstract Argumentation Under a Claim-Centric View Wolfgang Dvorák, Stefan Woltran

AAAI 2019 Forgetting in Modular Answer Set Programming Ricardo Gonçalves, Tomi Janhunen, Matthias Knorr, João Leite, Stefan Woltran

JAIR 2019 Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? Jan Maly, Miroslaw Truszczynski, Stefan Woltran

AAAI 2019 Strong Equivalence for Epistemic Logic Programs Made Easy Wolfgang Faber, Michael Morak, Stefan Woltran

IJCAI 2018 Belief Update in the Horn Fragment Nadia Creignou, Adrian Haret, Odile Papini, 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 Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? Jan Maly, Miroslaw Truszczynski, Stefan Woltran

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

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

AAAI 2018 Weighted Abstract Dialectical Frameworks Gerhard Brewka, Hannes Strass, Johannes Peter Wallner, Stefan Woltran

IJCAI 2017 A General Notion of Equivalence for Abstract Argumentation Ringo Baumann, Wolfgang Dvorák, Thomas Linsbichler, Stefan Woltran

JAIR 2017 Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning Michael Abseher, Nysret Musliu, Stefan Woltran

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

AAAI 2017 Solving Advanced Argumentation Problems with Answer-Set Programming Gerhard Brewka, Martin Diller, Georg Heissenberger, Thomas Linsbichler, Stefan Woltran

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

IJCAI 2016 ASP for Anytime Dynamic Programming on Tree Decompositions Bernhard Bliem, Benjamin Kaufmann, Torsten Schaub, Stefan Woltran

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

IJCAI 2016 Investigating the Relationship Between Argumentation Semantics via Signatures Paul E. Dunne, Christof Spanring, Thomas Linsbichler, Stefan Woltran

IJCAI 2015 An Extension-Based Approach to Belief Revision in Abstract Argumentation Martin Diller, Adrian Haret, Thomas Linsbichler, Stefan Rümmele, 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 Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning Michael Abseher, Frederico Dusberger, Nysret Musliu, Stefan Woltran

IJCAI 2015 Merging in the Horn Fragment Adrian Haret, Stefan Rümmele, Stefan Woltran

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

IJCAI 2013 Abstract Dialectical Frameworks Revisited Gerhard Brewka, Hannes Strass, Stefan Ellmauthaler, Johannes Peter Wallner, Stefan Woltran

AAAI 2013 Abstract Preference Frameworks - A Unifying Perspective on Separability and Strong Equivalence Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran

IJCAI 2013 Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? Nadia Creignou, Reinhard Pichler, Stefan Woltran

JAIR 2013 Strong Equivalence of Qualitative Optimization Problems Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran

JAIR 2011 On the Intertranslatability of Argumentation Semantics Wolfgang Dvorák, Stefan Woltran

IJCAI 2011 Parametric Properties of Ideal Semantics Wolfgang Dvorák, Paul E. Dunne, Stefan Woltran

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

AAAI 2010 Representing Preferences Among Sets Gerhard Brewka, Miroslaw Truszczynski, Stefan Woltran

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

JAIR 2009 Modularity Aspects of Disjunctive Stable Models Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran

AAAI 2008 Hyperequivalence of Logic Programs with Respect to Supported Models Miroslaw Truszczynski, Stefan Woltran

IJCAI 2007 Complexity Results for Checking Equivalence of Stratified Logic Programs Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran

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

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

AAAI 2005 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

AAAI 2000 Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltran