research
∙
05/30/2023
Solving Projected Model Counting by Utilizing Treewidth and its Limits
In this paper, we introduce a novel algorithm to solve projected model c...
share
research
∙
05/06/2022
Rediscovering Argumentation Principles Utilizing Collective Attacks
Argumentation Frameworks (AFs) are a key formalism in AI research. Their...
research
∙
04/28/2022
The Effect of Preferences in Abstract Argumentation Under a Claim-Centric View
In this paper, we study the effect of preferences in abstract argumentat...
research
∙
09/07/2021
Aspartix-V21
In this solver description we present ASPARTIX-V, in its 2021 edition, w...
research
∙
08/06/2021
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
Extending the popular Answer Set Programming (ASP) paradigm by introspec...
research
∙
06/09/2021
Choice Logics and Their Computational Properties
Qualitative Choice Logic (QCL) and Conjunctive Choice Logic (CCL) are fo...
research
∙
07/07/2020
Expressiveness of SETAFs and Support-Free ADFs under 3-valued Semantics
Generalizing the attack structure in argumentation frameworks (AFs) has ...
research
∙
01/13/2020
Structural Decompositions of Epistemic Logic Programs
Epistemic logic programs (ELPs) are a popular generalization of standard...
research
∙
01/13/2020
Exploiting Database Management Systems and Treewidth for Counting
Bounded treewidth is one of the most cited combinatorial invariants, whi...
research
∙
01/04/2020
selp: A Single-Shot Epistemic Logic Program Solver
Epistemic Logic Programs (ELPs) are an extension of Answer Set Programmi...
research
∙
12/05/2019
Solving Advanced Argumentation Problems with Answer Set Programming
Powerful formalisms for abstract argumentation have been proposed, among...
research
∙
09/02/2019
Design and Results of the Second International Competition on Computational Models of Argumentation
Argumentation is a major topic in the study of Artificial Intelligence. ...
research
∙
07/25/2019
On Uniform Equivalence of Epistemic Logic Programs
Epistemic Logic Programs (ELPs) extend Answer Set Programming (ASP) with...
research
∙
11/12/2018
Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version)
Epistemic Logic Programs (ELPs), that is, Answer Set Programming (ASP) e...
research
∙
06/20/2018
Weighted Abstract Dialectical Frameworks: Extended and Revised Report
Abstract Dialectical Frameworks (ADFs) generalize Dung's argumentation f...
research
∙
05/14/2018
Exploiting Treewidth for Projected Model Counting and its Limits
In this paper, we introduce a novel algorithm to solve projected model c...
research
∙
11/21/2017
Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?
Many reasoning problems are based on the problem of satisfiability (SAT)...
research
∙
07/17/2017
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...
research
∙
07/12/2017
Defensive Alliances in Graphs of Bounded Treewidth
A set S of vertices of a graph is a defensive alliance if, for each elem...
research
∙
06/28/2017
DynASP2.5: Dynamic Programming on Tree Decompositions in Action
A vibrant theoretical research area are efficient exact parameterized al...
research
∙
02/09/2017
Answer Set Solving with Bounded Treewidth Revisited
Parameterized algorithms are a way to solve hard problems more efficient...
research
∙
12/22/2016
Counting Answer Sets via Dynamic Programming
While the solution counting problem for propositional satisfiability (#S...
research
∙
08/05/2016
The Power of Non-Ground Rules in Answer Set Programming
Answer set programming (ASP) is a well-established logic programming lan...
research
∙
06/30/2016
Clique-Width and Directed Width Measures for Answer-Set Programming
Disjunctive Answer Set Programming (ASP) is a powerful declarative progr...
research
∙
03/31/2016
Distributing Knowledge into Simple Bases
Understanding the behavior of belief change operators for fragments of c...
research
∙
03/31/2016
Verifiability of Argumentation Semantics
Dung's abstract argumentation theory is a widely used formalism to model...
research
∙
07/23/2015
Improved Answer-Set Programming Encodings for Abstract Argumentation
The design of efficient solutions for abstract argumentation problems is...
research
∙
04/30/2014
Compact Argumentation Frameworks
Abstract argumentation frameworks (AFs) are one of the most studied form...
research
∙
04/25/2014
Belief merging within fragments of propositional logic
Recently, belief change within the framework of fragments of proposition...
research
∙
01/16/2014
On the Intertranslatability of Argumentation Semantics
Translations between different nonmonotonic formalisms always have been ...
research
∙
01/15/2014
Modularity Aspects of Disjunctive Stable Models
Practically all programming languages allow the programmer to split a pr...
research
∙
01/08/2013
Utilizing ASP for Generating and Visualizing Argumentation Frameworks
Within the area of computational models of argumentation, the instantiat...
research
∙
10/06/2012
D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming
In this work, we propose Answer-Set Programming (ASP) as a tool for rapi...
research
∙
04/13/2012
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough
Cardinality constraints or, more generally, weight constraints are well ...
research
∙
12/04/2011
Strong Equivalence of Qualitative Optimization Problems
We introduce the framework of qualitative optimization problems (or, sim...
research
∙
08/24/2011
Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems
Dung's famous abstract argumentation frameworks represent the core forma...
research
∙
08/24/2011
dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation
The aim of this paper is to announce the release of a novel system for a...
research
∙
12/30/2009
A general approach to belief change in answer set programming
We address the problem of belief change in (nonmonotonic) logic programm...
research
∙
07/23/2009
Relativized hyperequivalence of logic programs for modular programming
A recent framework of relativized hyperequivalence of programs offers a ...
research
∙
06/11/2009
Characterising equilibrium logic and nested logic programs: Reductions and complexity
Equilibrium logic is an approach to nonmonotonic reasoning that extends ...
research
∙
07/19/2002
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...
research
∙
03/08/2000