10 citations · 23 across the 11 of their papers we have counts for
12 papers
Fagin's Theorem for Semiring Turing Machines
Guillermo Badia, Manfred Droste, Thomas Eiter +3
In recent years, quantitative complexity over semirings has been intensively investigated. In this context, Eiter and Kiesel (Semiring Reasoning Frameworks in AI and Their Computat…
Solving Decision Theory Problems with Probabilistic Answer Set Programming
Damiano Azzolini, Elena Bellodi, Rafael Kiesel +1
Solving a decision theory problem usually involves finding the actions, among a set of possible ones, which optimize the expected reward, possibly accounting for the uncertainty of…
Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
Markus Hecher, Rafael Kiesel
Answer Set Programming (ASP) is a generic problem modeling and solving framework with a strong focus on knowledge representation and a rapid growth of industrial applications. So f…
"What if?" in Probabilistic Logic Programming
Rafael Kiesel, Kilian Rückschloß, Felix Weitkämper
A ProbLog program is a logic program with facts that only hold with a specified probability. In this contribution we extend this ProbLog language by the ability to answer "What if"…
Contextual Reasoning for Scene Generation (Technical Report)
Loris Bozzato, Thomas Eiter, Rafael Kiesel +1
We present a continuation to our previous work, in which we developed the MR-CKR framework to reason with knowledge overriding across contexts organized in multi-relational hierarc…
A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets
Rafael Kiesel, André Schidler
We propose a new approach to the Directed Feedback Vertex Set Problem (DFVSP), where the input is a directed graph and the solution is a minimum set of vertices whose removal makes…
Efficient Knowledge Compilation Beyond Weighted Model Counting
Rafael Kiesel, Pietro Totis, Angelika Kimmig
Quantitative extensions of logic programming often require the solution of so called second level inference tasks, i.e., problems that involve a third operation, such as maximizati…
Concurrence for well-formed CAFs: Naive Semantics
Rafael Kiesel, Anna Rapberger
In the area of claim-based reasoning in abstract argumentation, a claim-based semantics is said to be concurrent in a given framework if all its variants yield the same extensions.…
Quantitative and Stream Extensions of Answer Set Programming
Rafael Kiesel
Answer Set Programming has separately been extended with constraints, to the streaming domain, and with capabilities to reason over the quantities associated with answer sets. We p…
Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures
Loris Bozzato, Thomas Eiter, Rafael Kiesel
Dealing with context dependent knowledge has led to different formalizations of the notion of context. Among them is the Contextualized Knowledge Repository (CKR) framework, which…
ASP(AC): Answer Set Programming with Algebraic Constraints
Thomas Eiter, Rafael Kiesel
Weighted Logic is a powerful tool for the specification of calculations over semirings that depend on qualitative information. Using a novel combination of Weighted Logic and Here-…
A Mobile Application for Self-Guided Study of Formal Reasoning
David M. Cerna, Rafael P. D. Kiesel, Alexandra Dzhiganskaya
In this work, we introduce AXolotl, a self-study aid designed to guide students through the basics of formal reasoning and term manipulation. Unlike most of the existing study aids…