Stefan Woltran

From MaRDI portal
Person:334819

Available identifiers

zbMath Open woltran.stefanWikidataQ102344938 ScholiaQ102344938MaRDI QIDQ334819

List of research outcomes

PublicationDate of PublicationType
Exploiting Database Management Systems and Treewidth for Counting2023-12-12Paper
A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness2023-11-16Paper
Expressiveness of SETAFs and support-free ADFs under 3-valued semantics2023-10-30Paper
The complexity landscape of claim-augmented argumentation frameworks2023-06-19Paper
Strong Equivalence for Argumentation Frameworks with Collective Attacks2023-03-24Paper
Solving projected model counting by utilizing treewidth and its limits2023-01-04Paper
Sequent calculi for choice logics2022-12-07Paper
Choice logics and their computational properties2022-10-04Paper
Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility2022-08-02Paper
Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving2022-04-11Paper
On the different types of collective attacks in abstract argumentation: equivalence results for SETAFs2022-02-08Paper
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs2022-01-10Paper
Graph-classes of argumentation frameworks with collective attacks2021-12-01Paper
Solving Advanced Argumentation Problems with Answer Set Programming2021-09-03Paper
selp: A Single-Shot Epistemic Logic Program Solver2021-09-03Paper
https://portal.mardi4nfdi.de/entity/Q50095872021-08-04Paper
On the Relation Between Claim-Augmented Argumentation Frameworks and Collective Attacks2021-07-06Paper
https://portal.mardi4nfdi.de/entity/Q49992922021-07-06Paper
Lpopt: a rule optimization tool for answer set programming2021-05-20Paper
Taming high treewidth with abstraction, nested dynamic programming, and database technology2021-04-07Paper
Ranking-based semantics from the perspective of claims2021-01-21Paper
https://portal.mardi4nfdi.de/entity/Q51458112021-01-21Paper
On the limits of forgetting in answer set programming2020-11-16Paper
ASPARTIX-V19 -- an answer-set programming based system for abstract argumentation2020-10-26Paper
https://portal.mardi4nfdi.de/entity/Q51164042020-08-25Paper
Complexity of abstract argumentation under a claim-centric view2020-08-06Paper
Computing secure sets in graphs using answer set programming2020-08-05Paper
DynASP2.5: Dynamic Programming on Tree Decompositions in Action2020-05-27Paper
On Uniform Equivalence of Epistemic Logic Programs2020-05-04Paper
Multi-valued GRAPPA2020-02-18Paper
Preprocessing argumentation frameworks via replacement patterns2020-02-18Paper
On the Expressive Power of Collective Attacks2020-02-12Paper
https://portal.mardi4nfdi.de/entity/Q52156742020-02-12Paper
The Impact of Treewidth on Grounding and Solving of Answer Set Programs2020-01-22Paper
Design and results of the second international competition on computational models of argumentation2020-01-20Paper
Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided?2020-01-03Paper
A general notion of equivalence for abstract argumentation2019-08-28Paper
A multiparametric view on answer set programming2019-08-13Paper
Expansion-based QBF Solving on Tree Decompositions*2019-07-17Paper
General Belief Revision2019-02-25Paper
An extension-based approach to belief revision in abstract argumentation2019-02-20Paper
Defensive alliances in graphs of bounded treewidth2018-12-03Paper
https://portal.mardi4nfdi.de/entity/Q45532802018-11-02Paper
Equivalence between answer-set programs under (partially) fixed input2018-09-21Paper
Model-based recasting in answer-set programming2018-08-28Paper
Exploiting treewidth for projected model counting and its limits2018-08-10Paper
Complexity of secure sets2018-07-26Paper
https://portal.mardi4nfdi.de/entity/Q45761842018-07-12Paper
Translation-Based Revision and Merging for Minimal Horn Reasoning.2018-07-12Paper
Clique-Width and Directed Width Measures for Answer-Set Programming2018-07-12Paper
Implementing Courcelle's Theorem in a declarative framework for dynamic programming2018-02-13Paper
Shift Design with Answer Set Programming*2017-11-09Paper
D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy2017-11-09Paper
Improved answer-set programming encodings for abstract argumentation2017-11-09Paper
Dual-normal logic programs – the forgotten class2017-11-09Paper
The power of non-ground rules in Answer Set Programming2017-11-09Paper
When you must forget: Beyond strong persistence when forgetting in answer set programming2017-11-08Paper
Lpopt: a rule optimization tool for answer set programming2017-10-13Paper
https://portal.mardi4nfdi.de/entity/Q53572222017-09-14Paper
Answer set solving with bounded treewidth revisited2017-09-05Paper
https://portal.mardi4nfdi.de/entity/Q52829552017-07-18Paper
https://portal.mardi4nfdi.de/entity/Q52829682017-07-18Paper
https://portal.mardi4nfdi.de/entity/Q52829772017-07-18Paper
Merging in the Horn Fragment2017-07-13Paper
Semantical characterizations and complexity of equivalences in answer set programming2017-07-12Paper
Belief Merging within Fragments of Propositional Logic2017-07-12Paper
Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning2017-05-16Paper
The role of self-attacking arguments in characterizations of equivalence notions2017-01-31Paper
On rejected arguments and implicit conflicts: the hidden power of argumentation semantics2016-11-01Paper
Complexity of Secure Sets2016-10-21Paper
Equivalence Between Answer-Set Programs Under (Partially) Fixed Input2016-05-19Paper
Abstract Solvers for Dung’s Argumentation Frameworks2016-03-10Paper
The Hidden Power of Abstract Argumentation Semantics2016-03-10Paper
Characteristics of multiple viewpoints in abstract argumentation2015-12-09Paper
Shift Design with Answer Set Programming2015-11-04Paper
Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams2015-11-04Paper
A Model-Theoretic Approach to Belief Change in Answer Set Programming2015-09-17Paper
Complexity-sensitive decision procedures for abstract argumentation2015-08-27Paper
The complexity of handling minimal solutions in logic-based abduction2015-07-15Paper
Parametric properties of ideal semantics2015-06-26Paper
Methods for solving reasoning problems in abstract argumentation -- a survey2015-05-06Paper
A Glimpse on Gerhard Brewka’s Contributions to Artificial Intelligence2015-02-04Paper
The D-FLAT System for Dynamic Programming on Tree Decompositions2015-01-14Paper
Complexity of super-coherence problems in ASP2014-05-30Paper
Tractable answer-set programming with weight constraints: bounded treewidth is not enough2014-04-17Paper
Preprocessing of Complex Non-Ground Rules in Answer Set Programming2014-02-25Paper
Belief revision within fragments of propositional logic2013-12-13Paper
Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem2013-12-10Paper
The cf2 argumentation semantics revisited2013-11-21Paper
AGM-Style Belief Revision of Logic Programs under Answer Set Semantics2013-10-10Paper
Admissibility in the Abstract Dialectical Framework2013-10-04Paper
Advanced SAT Techniques for Abstract Argumentation2013-10-04Paper
Structural Properties for Deductive Argument Systems2013-08-05Paper
Strong Equivalence of Qualitative Optimization Problems2013-07-09Paper
D-FLAT: Declarative problem solving using tree decompositions and answer-set programming2013-03-13Paper
Towards fixed-parameter tractable algorithms for abstract argumentation2012-11-15Paper
Merging Logic Programs under Answer Set Semantics2012-11-13Paper
Multicut on Graphs of Bounded Clique-Width2012-11-02Paper
Parameterized Splitting: A Simple Modification-Based Approach2012-07-23Paper
Characterizing strong equivalence for argumentation frameworks2012-05-23Paper
Complexity of semi-stable and stage semantics in argumentation frameworks2012-01-18Paper
https://portal.mardi4nfdi.de/entity/Q31002332011-11-23Paper
On the Intertranslatability of Argumentation Semantics2011-10-18Paper
Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets2011-06-29Paper
Manifold Answer-Set Programs and Their Applications2011-05-19Paper
https://portal.mardi4nfdi.de/entity/Q29992232011-05-11Paper
Counting and Enumeration Problems with Bounded Treewidth2011-01-07Paper
A Dynamic-Programming Based ASP-Solver2010-10-01Paper
Multicut Algorithms via Tree Decompositions2010-05-28Paper
Symbolic and Quantitative Approaches to Reasoning with Uncertainty2010-04-06Paper
Encoding deductive argumentation in quantified Boolean formulae2009-12-21Paper
Modularity Aspects of Disjunctive Stable Models2009-12-10Paper
Relativized hyperequivalence of logic programs for modular programming2009-11-25Paper
Manifold Answer-Set Programs for Meta-reasoning2009-11-10Paper
Belief Revision with Bounded Treewidth2009-11-10Paper
Theory and Applications of Satisfiability Testing2009-07-24Paper
Hyperequivalence of logic programs with respect to supported models2009-07-06Paper
A solver for QBFs in negation normal form2009-05-29Paper
Fast Counting with Bounded Treewidth2009-01-27Paper
Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence2009-01-22Paper
Relativized Hyperequivalence of Logic Programs for Modular Programming2009-01-22Paper
Complexity results for answer set programming with bounded predicate arities and implications2008-04-21Paper
A common view on strong, uniform, and other notions of equivalence in answer-set programming2008-03-27Paper
Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets2008-03-04Paper
Debugging ASP Programs by Means of ASP2007-11-13Paper
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains2007-11-13Paper
Modularity Aspects of Disjunctive Stable Models2007-11-13Paper
Logic Programming and Nonmonotonic Reasoning2007-11-07Paper
Logic Programming and Nonmonotonic Reasoning2007-11-07Paper
Logics in Artificial Intelligence2006-10-25Paper
Logic Programming2006-06-27Paper
Logic Programming2005-08-26Paper
Inconsistency Tolerance2005-08-17Paper
On deciding subsumption problems2005-05-13Paper
On Computing Belief Change Operations using Quantified Boolean Formulas2005-03-21Paper
https://portal.mardi4nfdi.de/entity/Q44128542003-07-17Paper
https://portal.mardi4nfdi.de/entity/Q47089282003-06-20Paper
https://portal.mardi4nfdi.de/entity/Q47848592002-12-12Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Stefan Woltran