-
Article
Open AccessSequent Calculi for Choice Logics
Choice logics constitute a family of propositional logics and are used for the representation of preferences, with especially qualitative choice logic (QCL) being an established formalism with numerous applicatio...
-
Chapter and Conference Paper
Constrained Derivation in Assumption-Based Argumentation
Structured argumentation formalisms provide a rich framework to formalise and reason over situations where contradicting information is present. However, in most formalisms the integral step of constructing al...
-
Chapter
A Short Introduction to Artificial Intelligence: Methods, Success Stories, and Current Limitations
This chapter gives an overview of the most important methods in artificial intelligence (AI). The methods of symbolic AI are rooted in logic, and finding possible solutions by search is a central aspect. The m...
-
Chapter
It Is Simple, It Is Complicated
History is not a strictly linear process; our progress as society is one full of contradictions. This we have to bear in mind when trying to find answers to pressing challenges related to and even caused by th...
-
Chapter and Conference Paper
Sequent Calculi for Choice Logics
Choice logics constitute a family of propositional logics and are used for the representation of preferences, with especially qualitative choice logic (QCL) being an established formalism with numerous applicatio...
-
Chapter and Conference Paper
Graph-Classes of Argumentation Frameworks with Collective Attacks
Argumentation frameworks with collective attacks (SETAFs) have gained increasing attention in recent years as they provide a natural extension of the well-known abstract argumentation frameworks (AFs) due to D...
-
Chapter and Conference Paper
ASPARTIX-V19 - An Answer-Set Programming Based System for Abstract Argumentation
We present ASPARTIX-V, a tool for reasoning in abstract argumentation frameworks that is based on answer-set programming (ASP), in its 2019 release. ASPARTIX-V participated in this year’s edition of the Inter...
-
Chapter and Conference Paper
Exploiting Database Management Systems and Treewidth for Counting
Bounded treewidth is one of the most cited combinatorial invariants, which was applied in the literature for solving several counting problems efficiently. A canonical counting problem is #Sat, which asks to coun...
-
Chapter and Conference Paper
Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology
Treewidth is one of the most prominent structural parameters. While numerous theoretical results establish tractability under the assumption of fixed treewidth, the practical success of exploiting this paramet...
-
Article
Preface
-
Article
A multiparametric view on answer set programming
Disjunctive answer set programming (ASP) is an important framework for declarative modeling and problem solving, where the computational complexity of basic decision problems like consistency (deciding whether...
-
Chapter and Conference Paper
Strong Equivalence for Argumentation Frameworks with Collective Attacks
Argumentation frameworks with collective attacks are a prominent extension of Dung’s abstract argumentation frameworks, where an attack can be drawn from a set of arguments to another argument
-
Chapter and Conference Paper
Multi-valued GRAPPA
Abstract dialectical frameworks (ADFs) are generalizations of Dung’s argumentation frameworks which allow arbitrary relationships among arguments to be expressed. In particular, arguments can not only attack e...
-
Chapter and Conference Paper
Preprocessing Argumentation Frameworks via Replacement Patterns
A fast-growing research direction in the study of formal argumentation is the development of practical systems for central reasoning problems underlying argumentation. In particular, numerous systems for abstr...
-
Article
Open AccessComplexity of Secure Sets
A secure set S in a graph is defined as a set of vertices such that for any \(X\subseteq S\) ...
-
Article
Interview with Vladimir Lifschitz
This interview with Vladimir Lifschitz was conducted by Torsten Schaub at the University of Texas at Austin in August 2017. The question set was compiled by Torsten Schaub and Stefan Woltran.
-
Article
Interview with Gerhard Brewka
This interview with Gerhard Brewka was conducted by correspondance in May 2018. The question set was compiled by Torsten Schaub and Stefan Woltran.
-
Article
Dynamic Programming on Tree Decompositions with D-FLAT
Many hard problems can be solved efficiently by dynamic programming algorithms that work on tree decompositions. In this paper, we present the D-FLAT system for rapid prototy** of such algorithms. Users can ...
-
Article
Answer set programming unleashed!
Answer Set Programming faces an increasing popularity for problem solving in various domains. While its modeling language allows us to express many complex problems in an easy way, its solving technology enabl...
-
Article
Special Issue on Answer Set Programming
