| Publication | Date of Publication | Type |
|---|
| Constrained derivation in assumption-based argumentation | 2024-10-30 | Paper |
| Sequent calculi for choice logics | 2024-06-10 | Paper |
| Exploiting Database Management Systems and Treewidth for Counting | 2023-12-12 | Paper |
| A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness | 2023-11-16 | Paper |
| Expressiveness of SETAFs and support-free ADFs under 3-valued semantics | 2023-10-30 | Paper |
| The complexity landscape of claim-augmented argumentation frameworks | 2023-06-19 | Paper |
| Strong Equivalence for Argumentation Frameworks with Collective Attacks | 2023-03-24 | Paper |
| Solving projected model counting by utilizing treewidth and its limits | 2023-01-04 | Paper |
| Sequent calculi for choice logics | 2022-12-07 | Paper |
| Choice logics and their computational properties | 2022-10-04 | Paper |
| Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility | 2022-08-02 | Paper |
| Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving | 2022-04-11 | Paper |
| On the different types of collective attacks in abstract argumentation: equivalence results for SETAFs | 2022-02-08 | Paper |
| Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs | 2022-01-10 | Paper |
| Graph-classes of argumentation frameworks with collective attacks | 2021-12-01 | Paper |
| selp: A Single-Shot Epistemic Logic Program Solver | 2021-09-03 | Paper |
| Solving Advanced Argumentation Problems with Answer Set Programming | 2021-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009587 | 2021-08-04 | Paper |
| On the Relation Between Claim-Augmented Argumentation Frameworks and Collective Attacks | 2021-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4999292 | 2021-07-06 | Paper |
| Lpopt: a rule optimization tool for answer set programming | 2021-05-20 | Paper |
| Taming high treewidth with abstraction, nested dynamic programming, and database technology | 2021-04-07 | Paper |
| Ranking-based semantics from the perspective of claims | 2021-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5145811 | 2021-01-21 | Paper |
| On the limits of forgetting in answer set programming | 2020-11-16 | Paper |
| ASPARTIX-V19 -- an answer-set programming based system for abstract argumentation | 2020-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116404 | 2020-08-25 | Paper |
| Complexity of abstract argumentation under a claim-centric view | 2020-08-06 | Paper |
| Computing secure sets in graphs using answer set programming | 2020-08-05 | Paper |
| DynASP2.5: Dynamic Programming on Tree Decompositions in Action | 2020-05-27 | Paper |
| On Uniform Equivalence of Epistemic Logic Programs | 2020-05-04 | Paper |
| Multi-valued GRAPPA | 2020-02-18 | Paper |
| Preprocessing argumentation frameworks via replacement patterns | 2020-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5215674 | 2020-02-12 | Paper |
| On the Expressive Power of Collective Attacks | 2020-02-12 | Paper |
| The Impact of Treewidth on Grounding and Solving of Answer Set Programs | 2020-01-22 | Paper |
| Design and results of the second international competition on computational models of argumentation | 2020-01-20 | Paper |
| Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? | 2020-01-03 | Paper |
| A general notion of equivalence for abstract argumentation | 2019-08-28 | Paper |
| A multiparametric view on answer set programming | 2019-08-13 | Paper |
| Expansion-based QBF Solving on Tree Decompositions* | 2019-07-17 | Paper |
| General Belief Revision | 2019-02-25 | Paper |
| An extension-based approach to belief revision in abstract argumentation | 2019-02-20 | Paper |
| Defensive alliances in graphs of bounded treewidth | 2018-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4553280 | 2018-11-02 | Paper |
| Equivalence between answer-set programs under (partially) fixed input | 2018-09-21 | Paper |
| Model-based recasting in answer-set programming | 2018-08-28 | Paper |
| Exploiting treewidth for projected model counting and its limits | 2018-08-10 | Paper |
| Complexity of secure sets | 2018-07-26 | Paper |
| Clique-Width and Directed Width Measures for Answer-Set Programming | 2018-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4576184 | 2018-07-12 | Paper |
| Translation-Based Revision and Merging for Minimal Horn Reasoning. | 2018-07-12 | Paper |
| Implementing Courcelle's Theorem in a declarative framework for dynamic programming | 2018-02-13 | Paper |
| Dual-normal logic programs – the forgotten class | 2017-11-09 | Paper |
| The power of non-ground rules in Answer Set Programming | 2017-11-09 | Paper |
| D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy | 2017-11-09 | Paper |
| Shift Design with Answer Set Programming* | 2017-11-09 | Paper |
| Improved answer-set programming encodings for abstract argumentation | 2017-11-09 | Paper |
| When you must forget: Beyond strong persistence when forgetting in answer set programming | 2017-11-08 | Paper |
| Lpopt: a rule optimization tool for answer set programming | 2017-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5357222 | 2017-09-14 | Paper |
| Answer set solving with bounded treewidth revisited | 2017-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5282968 | 2017-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5282955 | 2017-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5282977 | 2017-07-18 | Paper |
| Merging in the Horn Fragment | 2017-07-13 | Paper |
| Semantical characterizations and complexity of equivalences in answer set programming | 2017-07-12 | Paper |
| Belief Merging within Fragments of Propositional Logic | 2017-07-12 | Paper |
| Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning | 2017-05-16 | Paper |
| The role of self-attacking arguments in characterizations of equivalence notions | 2017-01-31 | Paper |
| On rejected arguments and implicit conflicts: the hidden power of argumentation semantics | 2016-11-01 | Paper |
| Complexity of Secure Sets | 2016-10-21 | Paper |
| Equivalence Between Answer-Set Programs Under (Partially) Fixed Input | 2016-05-19 | Paper |
| The Hidden Power of Abstract Argumentation Semantics | 2016-03-10 | Paper |
| Abstract Solvers for Dung’s Argumentation Frameworks | 2016-03-10 | Paper |
| Characteristics of multiple viewpoints in abstract argumentation | 2015-12-09 | Paper |
| Shift Design with Answer Set Programming | 2015-11-04 | Paper |
| Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams | 2015-11-04 | Paper |
| A Model-Theoretic Approach to Belief Change in Answer Set Programming | 2015-09-17 | Paper |
| Complexity-sensitive decision procedures for abstract argumentation | 2015-08-27 | Paper |
| The complexity of handling minimal solutions in logic-based abduction | 2015-07-15 | Paper |
| Parametric properties of ideal semantics | 2015-06-26 | Paper |
| Methods for solving reasoning problems in abstract argumentation -- a survey | 2015-05-06 | Paper |
| A Glimpse on Gerhard Brewka’s Contributions to Artificial Intelligence | 2015-02-04 | Paper |
| The D-FLAT System for Dynamic Programming on Tree Decompositions | 2015-01-14 | Paper |
| Complexity of super-coherence problems in ASP | 2014-05-30 | Paper |
| Tractable answer-set programming with weight constraints: bounded treewidth is not enough | 2014-04-17 | Paper |
| Preprocessing of Complex Non-Ground Rules in Answer Set Programming | 2014-02-25 | Paper |
| Belief revision within fragments of propositional logic | 2013-12-13 | Paper |
| Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem | 2013-12-10 | Paper |
| The \(cf2\) argumentation semantics revisited | 2013-11-21 | Paper |
| AGM-Style Belief Revision of Logic Programs under Answer Set Semantics | 2013-10-10 | Paper |
| Admissibility in the Abstract Dialectical Framework | 2013-10-04 | Paper |
| Advanced SAT Techniques for Abstract Argumentation | 2013-10-04 | Paper |
| Structural Properties for Deductive Argument Systems | 2013-08-05 | Paper |
| Strong equivalence of qualitative optimization problems | 2013-07-09 | Paper |
| D-FLAT: Declarative problem solving using tree decompositions and answer-set programming | 2013-03-13 | Paper |
| Towards fixed-parameter tractable algorithms for abstract argumentation | 2012-11-15 | Paper |
| Merging Logic Programs under Answer Set Semantics | 2012-11-13 | Paper |
| Multicut on Graphs of Bounded Clique-Width | 2012-11-02 | Paper |
| Parameterized Splitting: A Simple Modification-Based Approach | 2012-07-23 | Paper |
| Characterizing strong equivalence for argumentation frameworks | 2012-05-23 | Paper |
| Complexity of semi-stable and stage semantics in argumentation frameworks | 2012-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3100233 | 2011-11-23 | Paper |
| On the Intertranslatability of Argumentation Semantics | 2011-10-18 | Paper |
| Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets | 2011-06-29 | Paper |
| Manifold Answer-Set Programs and Their Applications | 2011-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2999223 | 2011-05-11 | Paper |
| Counting and Enumeration Problems with Bounded Treewidth | 2011-01-07 | Paper |
| A Dynamic-Programming Based ASP-Solver | 2010-10-01 | Paper |
| Multicut Algorithms via Tree Decompositions | 2010-05-28 | Paper |
| Symbolic and Quantitative Approaches to Reasoning with Uncertainty | 2010-04-06 | Paper |
| Encoding deductive argumentation in quantified Boolean formulae | 2009-12-21 | Paper |
| Modularity Aspects of Disjunctive Stable Models | 2009-12-10 | Paper |
| Relativized hyperequivalence of logic programs for modular programming | 2009-11-25 | Paper |
| Belief Revision with Bounded Treewidth | 2009-11-10 | Paper |
| Manifold Answer-Set Programs for Meta-reasoning | 2009-11-10 | Paper |
| Theory and Applications of Satisfiability Testing | 2009-07-24 | Paper |
| Hyperequivalence of logic programs with respect to supported models | 2009-07-06 | Paper |
| A solver for QBFs in negation normal form | 2009-05-29 | Paper |
| Fast Counting with Bounded Treewidth | 2009-01-27 | Paper |
| Relativized Hyperequivalence of Logic Programs for Modular Programming | 2009-01-22 | Paper |
| Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence | 2009-01-22 | Paper |
| Complexity results for answer set programming with bounded predicate arities and implications | 2008-04-21 | Paper |
| A common view on strong, uniform, and other notions of equivalence in answer-set programming | 2008-03-27 | Paper |
| Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets | 2008-03-04 | Paper |
| Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains | 2007-11-13 | Paper |
| Modularity Aspects of Disjunctive Stable Models | 2007-11-13 | Paper |
| Debugging ASP Programs by Means of ASP | 2007-11-13 | Paper |
| Logic Programming and Nonmonotonic Reasoning | 2007-11-07 | Paper |
| Logic Programming and Nonmonotonic Reasoning | 2007-11-07 | Paper |
| Logics in Artificial Intelligence | 2006-10-25 | Paper |
| Logic Programming | 2006-06-27 | Paper |
| Logic Programming | 2005-08-26 | Paper |
| Inconsistency Tolerance | 2005-08-17 | Paper |
| On deciding subsumption problems | 2005-05-13 | Paper |
| On Computing Belief Change Operations using Quantified Boolean Formulas | 2005-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412854 | 2003-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708928 | 2003-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4784859 | 2002-12-12 | Paper |
