
Choice Logics and Their Computational Properties
Qualitative Choice Logic (QCL) and Conjunctive Choice Logic (CCL) are fo...
read it

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

Structural Decompositions of Epistemic Logic Programs
Epistemic logic programs (ELPs) are a popular generalization of standard...
read it

Exploiting Database Management Systems and Treewidth for Counting
Bounded treewidth is one of the most cited combinatorial invariants, whi...
read it

selp: A SingleShot Epistemic Logic Program Solver
Epistemic Logic Programs (ELPs) are an extension of Answer Set Programmi...
read it

Solving Advanced Argumentation Problems with Answer Set Programming
Powerful formalisms for abstract argumentation have been proposed, among...
read it

Design and Results of the Second International Competition on Computational Models of Argumentation
Argumentation is a major topic in the study of Artificial Intelligence. ...
read it

On Uniform Equivalence of Epistemic Logic Programs
Epistemic Logic Programs (ELPs) extend Answer Set Programming (ASP) with...
read it

Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version)
Epistemic Logic Programs (ELPs), that is, Answer Set Programming (ASP) e...
read it

Weighted Abstract Dialectical Frameworks: Extended and Revised Report
Abstract Dialectical Frameworks (ADFs) generalize Dung's argumentation f...
read it

Exploiting Treewidth for Projected Model Counting and its Limits
In this paper, we introduce a novel algorithm to solve projected model c...
read it

Do Hard SATRelated Reasoning Tasks Become Easier in the Krom Fragment?
Many reasoning problems are based on the problem of satisfiability (SAT)...
read it

When You Must Forget: beyond strong persistence when forgetting in answer set programming
Among the myriad of desirable properties discussed in the context of for...
read it

Defensive Alliances in Graphs of Bounded Treewidth
A set S of vertices of a graph is a defensive alliance if, for each elem...
read it

DynASP2.5: Dynamic Programming on Tree Decompositions in Action
A vibrant theoretical research area are efficient exact parameterized al...
read it

Answer Set Solving with Bounded Treewidth Revisited
Parameterized algorithms are a way to solve hard problems more efficient...
read it

Counting Answer Sets via Dynamic Programming
While the solution counting problem for propositional satisfiability (#S...
read it

The Power of NonGround Rules in Answer Set Programming
Answer set programming (ASP) is a wellestablished logic programming lan...
read it

CliqueWidth and Directed Width Measures for AnswerSet Programming
Disjunctive Answer Set Programming (ASP) is a powerful declarative progr...
read it

Distributing Knowledge into Simple Bases
Understanding the behavior of belief change operators for fragments of c...
read it

Verifiability of Argumentation Semantics
Dung's abstract argumentation theory is a widely used formalism to model...
read it

Improved AnswerSet Programming Encodings for Abstract Argumentation
The design of efficient solutions for abstract argumentation problems is...
read it

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

Belief merging within fragments of propositional logic
Recently, belief change within the framework of fragments of proposition...
read it

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

Modularity Aspects of Disjunctive Stable Models
Practically all programming languages allow the programmer to split a pr...
read it

Utilizing ASP for Generating and Visualizing Argumentation Frameworks
Within the area of computational models of argumentation, the instantiat...
read it

DFLAT: Declarative Problem Solving Using Tree Decompositions and AnswerSet Programming
In this work, we propose AnswerSet Programming (ASP) as a tool for rapi...
read it

Tractable AnswerSet Programming with Weight Constraints: Bounded Treewidth is not Enough
Cardinality constraints or, more generally, weight constraints are well ...
read it

Strong Equivalence of Qualitative Optimization Problems
We introduce the framework of qualitative optimization problems (or, sim...
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

A general approach to belief change in answer set programming
We address the problem of belief change in (nonmonotonic) logic programm...
read it

Relativized hyperequivalence of logic programs for modular programming
A recent framework of relativized hyperequivalence of programs offers a ...
read it

Characterising equilibrium logic and nested logic programs: Reductions and complexity
Equilibrium logic is an approach to nonmonotonic reasoning that extends ...
read it

A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report
Nested logic programs have recently been introduced in order to allow fo...
read it

QUIP  A Tool for Computing Nonmonotonic Reasoning Tasks
In this paper, we outline the prototype of an automated inference tool, ...
read it
Stefan Woltran
is this you? claim profile
Full Professor at Vienna University of Technology, Assistant Professor at Vienna University of Technology, PhD in Computer Science at Vienna University of Technology, Project research assistant in the KnowledgeBased Systems Group by the Austrian Research Fund (FWF), Associate professor at the Database and Artificial Intelligence Group, Deputy professorship at Leipzig University from 20132015.