
AspartixV21
In this solver description we present ASPARTIXV, in its 2021 edition, w...
read it

Symbolic Time and Space Tradeoffs for Probabilistic Verification
We present a faster symbolic algorithm for the following central problem...
read it

Expressiveness of SETAFs and SupportFree ADFs under 3valued Semantics
Generalizing the attack structure in argumentation frameworks (AFs) has ...
read it

NearLinear Time Algorithms for Streett Objectives in Graphs and MDPs
The fundamental modelchecking problem, given as input a model and a spe...
read it

Quasipolynomial SetBased Symbolic Algorithms for Parity Games
Solving parity games, which are equivalent to modal μcalculus model che...
read it

Algorithms and Conditional Lower Bounds for Planning Problems
We consider planning problems for graphs, Markov decision processes (MDP...
read it

Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter
A model of computation that is widely used in the formal analysis of rea...
read it

Compact Argumentation Frameworks
Abstract argumentation frameworks (AFs) are one of the most studied form...
read it

On the Intertranslatability of Argumentation Semantics
Translations between different nonmonotonic formalisms always have been ...
read it

Technical Note: Exploring Σ^P_2 / Π^P_2hardness for Argumentation Problems with fixed distance to tractable classes
We study the complexity of reasoning in abstracts argumentation framewor...
read it

Making Use of Advances in AnswerSet Programming for Abstract Argumentation Systems
Dung's famous abstract argumentation frameworks represent the core forma...
read it

dynPARTIX  A Dynamic Programming Reasoner for Abstract Argumentation
The aim of this paper is to announce the release of a novel system for a...
read it
Wolfgang Dvorák
is this you? claim profile