1 citations · 1 across the 5 of their papers we have counts for
6 papers · 1 filter
selp: A Single-Shot Epistemic Logic Program Solver
Manuel Bichler, Michael Morak, Stefan Woltran
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…
Epistemic Logic Programs: A Different World View
Michael Morak
Epistemic Logic Programs (ELPs), an extension of Answer Set Programming (ASP) with epistemic operators, have received renewed attention from the research community in recent years.…
On Uniform Equivalence of Epistemic Logic Programs
Wolfgang Faber, Michael Morak, Stefan Woltran
Epistemic Logic Programs (ELPs) extend Answer Set Programming (ASP) with epistemic negation and have received renewed interest in recent years. This led to the development of new r…
Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version)
Wolfgang Faber, Michael Morak, Stefan Woltran
Epistemic Logic Programs (ELPs), that is, Answer Set Programming (ASP) extended with epistemic operators, have received renewed interest in recent years, which led to a flurry of n…
DynASP2.5: Dynamic Programming on Tree Decompositions in Action
Johannes K. Fichte, Markus Hecher, Michael Morak +1
A vibrant theoretical research area are efficient exact parameterized algorithms. Very recent solving competitions such as the PACE challenge show that there is also increasing pra…
Answer Set Solving with Bounded Treewidth Revisited
Johannes Fichte, Markus Hecher, Michael Morak +1
Parameterized algorithms are a way to solve hard problems more efficiently, given that a specific parameter of the input is small. In this paper, we apply this idea to the field of…