Search Results for author:
Found 30 papers, 3 papers with code
Modularity Aspects of Disjunctive Stable Models
Practically all programming languages allow the programmer to split a program into several modules which brings along several advantages in software development.
On the Intertranslatability of Argumentation Semantics
Translations between different nonmonotonic formalisms always have been an important topic in the field, in particular to understand the knowledge-representation capabilities those formalisms offer.
Belief merging within fragments of propositional logic
This paper presents a general approach to define new merging operators derived from existing ones such that the result of merging remains in the fragment under consideration.
Compact Argumentation Frameworks
(3) Finally, we show that compact AFs are indeed a non-trivial subclass, since the verification problem remains coNP-hard for certain semantics.
Dual-normal Logic Programs - the Forgotten Class
Identifying classes of programs for which the consistency problem is in NP is of interest from the theoretical standpoint and can potentially lead to improvements in the design of answer set programming solvers.
Improved Answer-Set Programming Encodings for Abstract Argumentation
The design of efficient solutions for abstract argumentation problems is a crucial step towards advanced argumentation systems.
Distributing Knowledge into Simple Bases
In other words, we are interested in seeing if $K$ can be distributed into knowledge bases of simpler structure, such that the task of merging allows for a reconstruction of the original knowledge.
Verifiability of Argumentation Semantics
Dung's abstract argumentation theory is a widely used formalism to model conflicting information and to draw conclusions in such situations.
Clique-Width and Directed Width Measures for Answer-Set Programming
We then consider the graph parameter of signed clique-width and present a novel dynamic programming algorithm that is FPT w. r. t.
The Power of Non-Ground Rules in Answer Set Programming
In its traditional application, a fixed ASP program for a given problem is designed and the actual instance of the problem is fed into the program as a set of facts.
lpopt: A Rule Optimization Tool for Answer Set Programming
State-of-the-art answer set programming (ASP) solvers rely on a program called a grounder to convert non-ground programs containing variables into variable-free, propositional programs.
Counting Answer Sets via Dynamic Programming
While the solution counting problem for propositional satisfiability (#SAT) has received renewed attention in recent years, this research trend has not affected other AI solving paradigms like answer set programming (ASP).
Answer Set Solving with Bounded Treewidth Revisited
Parameterized algorithms are a way to solve hard problems more efficiently, given that a specific parameter of the input is small.
DynASP2.5: Dynamic Programming on Tree Decompositions in Action
In this paper, we describe underlying concepts of our new implementation (DynASP2. 5) that shows competitive behavior to state-of-the-art ASP solvers even for finding just one solution when solving problems as the Steiner tree problem that have been modeled in ASP on graphs with low treewidth.
When You Must Forget: beyond strong persistence when forgetting in answer set programming
However, it is an open question what to do when we have to forget a set of atoms, but cannot without violating this property.
Exploiting Treewidth for Projected Model Counting and its Limits
It runs in time $O({2^{2^{k+4}} n^2})$ where k is the treewidth and n is the input size of the instance.
Weighted Abstract Dialectical Frameworks: Extended and Revised Report
Abstract Dialectical Frameworks (ADFs) generalize Dung's argumentation frameworks allowing various relationships among arguments to be expressed in a systematic way.
On Uniform Equivalence of Epistemic Logic Programs
Epistemic Logic Programs (ELPs) extend Answer Set Programming (ASP) with epistemic negation and have received renewed interest in recent years.
Design and Results of the Second International Competition on Computational Models of Argumentation
Argumentation is a major topic in the study of Artificial Intelligence.
Solving Advanced Argumentation Problems with Answer Set Programming
Powerful formalisms for abstract argumentation have been proposed, among them abstract dialectical frameworks (ADFs) that allow for a succinct and flexible specification of the relationship between arguments, and the GRAPPA framework which allows argumentation scenarios to be represented as arbitrary edge-labelled graphs.
selp: A Single-Shot Epistemic Logic Program Solver
Epistemic Logic Programs (ELPs) are an extension of Answer Set Programming (ASP) with epistemic operators that allow for a form of meta-reasoning, that is, reasoning over multiple possible worlds.
Structural Decompositions of Epistemic Logic Programs
Epistemic logic programs (ELPs) are a popular generalization of standard Answer Set Programming (ASP) providing means for reasoning over answer sets within the language.
Exploiting Database Management Systems and Treewidth for Counting
This paper deals with counting problems for instances of small treewidth.
Expressiveness of SETAFs and Support-Free ADFs under 3-valued Semantics
Generalizing the attack structure in argumentation frameworks (AFs) has been studied in different ways.
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
In this paper, we take a next step and contribute to epistemic logic programming in two ways: First, we establish quantitative reasoning for ELPs, where the acceptance of a certain set of literals depends on the number (proportion) of world views that are compatible with the set.
Aspartix-V21
In this solver description we present ASPARTIX-V, in its 2021 edition, which participates in the International Competition on Computational Models of Argumentation (ICCMA) 2021.
The Effect of Preferences in Abstract Argumentation Under a Claim-Centric View
In this paper, we study the effect of preferences in abstract argumentation under a claim-centric perspective.
Rediscovering Argumentation Principles Utilizing Collective Attacks
We extend the principle-based approach to Argumentation Frameworks with Collective Attacks (SETAFs) and provide a comprehensive overview of common principles for their semantics.
Solving Projected Model Counting by Utilizing Treewidth and its Limits
Inspired by the observation that the so-called "treewidth" is one of the most prominent structural parameters, our algorithm utilizes small treewidth of the primal graph of the input instance.
A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming
Answer Set Programming (ASP) is a prominent rule-based language for knowledge representation and reasoning with roots in logic programming and non-monotonic reasoning.
