Search Results for author:
Found 7 papers, 2 papers with code
Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
Our results provide an in-depth hardness study, relying on a novel reduction from normal to disjunctive programs, trading the increase of complexity for an exponential parameter compression.
"What if?" in Probabilistic Logic Programming
A ProbLog program is a logic program with facts that only hold with a specified probability.
Contextual Reasoning for Scene Generation (Technical Report)
In this paper, we show how to apply our theoretical work to real autonomous-vehicle scene data.
Efficient Knowledge Compilation Beyond Weighted Model Counting
We introduce Second Level Algebraic Model Counting (2AMC) as a generic framework for these kinds of problems.
Quantitative and Stream Extensions of Answer Set Programming
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.
Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures
In this paper, we overcome these limitations and present a generalization of CKR hierarchies to multiple contextual relations, along with their interpretation of defeasible axioms and preference.
ASP(AC): Answer Set Programming with Algebraic Constraints
Using a novel combination of Weighted Logic and Here-and-There (HT) Logic, in which this dependence is based on intuitionistic grounds, we introduce Answer Set Programming with Algebraic Constraints (ASP(AC)), where rules may contain constraints that compare semiring values to weighted formula evaluations.
