1 citations · 1 across the 3 of their papers we have counts for
4 papers
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…
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.…