15 citations · 21 across the 13 of their papers we have counts for
15 papers
Solving Projected Model Counting by Utilizing Treewidth and its Limits
Johannes K. Fichte, Markus Hecher, Michael Morak +2
In this paper, we introduce a novel algorithm to solve projected model counting (PMC). PMC asks to count solutions of a Boolean formula with respect to a given set of projection va…
Generative Datalog with Stable Negation
Mario Alviano, Matthias Lanzinger, Michael Morak +1
Extending programming languages with stochastic behaviour such as probabilistic choices or random sampling has a long tradition in computer science. A recent development in this di…
Determining ActionReversibility in STRIPS Using Answer Set and Epistemic Logic Programming
Wolfgang Faber, Michael Morak, Lukáš Chrpa
In the context of planning and reasoning about actions and change, we call an action reversible when its effects can be reverted by applying other actions, returning to the origina…
Structural Decompositions of Epistemic Logic Programs
Markus Hecher, Michael Morak, Stefan Woltran
Epistemic logic programs (ELPs) are a popular generalization of standard Answer Set Programming (ASP) providing means for reasoning over answer sets within the language. This riche…
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.…