research
∙
05/30/2023
Solving Projected Model Counting by Utilizing Treewidth and its Limits
In this paper, we introduce a novel algorithm to solve projected model c...
share
research
∙
06/24/2022
Generative Datalog with Stable Negation
Extending programming languages with stochastic behaviour such as probab...
research
∙
08/11/2021
Determining ActionReversibility in STRIPS Using Answer Set and Epistemic Logic Programming
In the context of planning and reasoning about actions and change, we ca...
research
∙
01/13/2020
Structural Decompositions of Epistemic Logic Programs
Epistemic logic programs (ELPs) are a popular generalization of standard...
research
∙
01/04/2020
selp: A Single-Shot Epistemic Logic Program Solver
Epistemic Logic Programs (ELPs) are an extension of Answer Set Programmi...
research
∙
09/18/2019
Epistemic Logic Programs: A Different World View
Epistemic Logic Programs (ELPs), an extension of Answer Set Programming ...
research
∙
07/25/2019
On Uniform Equivalence of Epistemic Logic Programs
Epistemic Logic Programs (ELPs) extend Answer Set Programming (ASP) with...
research
∙
11/12/2018
Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version)
Epistemic Logic Programs (ELPs), that is, Answer Set Programming (ASP) e...
research
∙
05/14/2018
Exploiting Treewidth for Projected Model Counting and its Limits
In this paper, we introduce a novel algorithm to solve projected model c...
research
∙
06/28/2017
DynASP2.5: Dynamic Programming on Tree Decompositions in Action
A vibrant theoretical research area are efficient exact parameterized al...
research
∙
02/09/2017
Answer Set Solving with Bounded Treewidth Revisited
Parameterized algorithms are a way to solve hard problems more efficient...
research
∙
12/22/2016
Counting Answer Sets via Dynamic Programming
While the solution counting problem for propositional satisfiability (#S...
research
∙
08/05/2016
The Power of Non-Ground Rules in Answer Set Programming
Answer set programming (ASP) is a well-established logic programming lan...
research
∙
10/06/2012
D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming
In this work, we propose Answer-Set Programming (ASP) as a tool for rapi...
research
∙
08/24/2011
