Michael Morak
YOU?
Author Swipe
View article: Weak and Strong Reversibility of Non-deterministic Actions: Universality and Uniformity
Weak and Strong Reversibility of Non-deterministic Actions: Universality and Uniformity Open
Classical planning looks for a sequence of actions that transform the initial state of the environment into a goal state. Studying whether the effects of an action can be undone by a sequence of other actions, that is, action reversibility…
View article: Evaluating Epistemic Logic Programs via Answer Set Programming with Quantifiers
Evaluating Epistemic Logic Programs via Answer Set Programming with Quantifiers Open
In this paper we introduce a simple way to evaluate epistemic logic programs by means of answer set programming with quantifiers, a recently proposed extension of answer set programming. The method can easily be adapted for most of the man…
View article: Solving Projected Model Counting by Utilizing Treewidth and its Limits
Solving Projected Model Counting by Utilizing Treewidth and its Limits Open
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 variables, where multiple solutions that are identical when r…
View article: Generative Datalog with Stable Negation
Generative Datalog with Stable Negation Open
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 direction is a declarative probabilistic programming language…
View article: Sticky Existential Rules and Disjunction are Incompatible
Sticky Existential Rules and Disjunction are Incompatible Open
Stickiness is one of the well-known properties in the literature that guarantees decidability of query answering under sets of existential rules, that is, Datalog rules extended with existential quantification in rule heads. In this note, …
View article: Universal and Uniform Action Reversibility
Universal and Uniform Action Reversibility Open
The problem of action reversibility studies whether effects of a given action can be reversed (or undone) by a sequence of (other) actions. For example, actions whose effects can be reversed cannot lead to dead-ends. In the usual settings,…
View article: Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming
Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming Open
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 original state. Renewed interest in this area has led to several r…
View article: Determining ActionReversibility in STRIPS Using Answer Set and Epistemic\n Logic Programming
Determining ActionReversibility in STRIPS Using Answer Set and Epistemic\n Logic Programming Open
In the context of planning and reasoning about actions and change, we call an\naction reversible when its effects can be reverted by applying other actions,\nreturning to the original state. Renewed interest in this area has led to\nsevera…
View article: DynASP2.5: Dynamic Programming on Tree Decompositions in Action
DynASP2.5: Dynamic Programming on Tree Decompositions in Action Open
Efficient exact parameterized algorithms are an active research area. Such algorithms exhibit a broad interest in the theoretical community. In the last few years, implementations for computing various parameters (parameter detection) have…
View article: On the Reversibility of Actions in Planning
On the Reversibility of Actions in Planning Open
Checking whether action effects can be undone is an important question for determining, for instance, whether a planning task has dead-ends. In this paper, we investigate the reversibility of actions, that is, when the effects of an action…
View article: Structural Decompositions of Epistemic Logic Programs
Structural Decompositions of Epistemic Logic Programs Open
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 richer formalism comes at the price of higher computational comp…
View article: selp: <i>A Single-Shot Epistemic Logic Program Solver</i>
selp: <i>A Single-Shot Epistemic Logic Program Solver</i> Open
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 possible worlds. Existing ELP solving approaches generally …
View article: Structural Decompositions of Epistemic Logic Programs
Structural Decompositions of Epistemic Logic Programs Open
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 richer formalism comes at the price of higher computational comp…
View article: The Impact of Treewidth on Grounding and Solving of Answer Set Programs
The Impact of Treewidth on Grounding and Solving of Answer Set Programs Open
In this paper, we aim to study how the performance of modern answer set programming (ASP) solvers is influenced by the treewidth of the input program and to investigate the consequences of this relationship. We first perform an experimenta…
View article: selp: A Single-Shot Epistemic Logic Program Solver
selp: A Single-Shot Epistemic Logic Program Solver Open
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 possible worlds. Existing ELP solving approaches generally …
View article: Epistemic Logic Programs: A Different World View
Epistemic Logic Programs: A Different World View Open
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. Classically, evaluating an ELP yields a set of world views…
View article: Strong Equivalence for Epistemic Logic Programs Made Easy
Strong Equivalence for Epistemic Logic Programs Made Easy Open
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 new research, as well as efficient solvers. An important que…
View article: Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version)
Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version) Open
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 new research, as well as efficient solvers. An important que…
View article: Single-Shot Epistemic Logic Program Solving
Single-Shot Epistemic Logic Program Solving Open
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 possible worlds. Existing ELP solving approaches generally …
View article: Exploiting Treewidth for Projected Model Counting and its Limits
Exploiting Treewidth for Projected Model Counting and its Limits Open
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 projected variables, where multiple solutions that are identical when re…
View article: The Impact of Treewidth on ASP Grounding and Solving
The Impact of Treewidth on ASP Grounding and Solving Open
In this paper, we aim to study how the performance of modern answer set programming (ASP) solvers is influenced by the treewidth of the input program and to investigate the consequences of this relationship. We first perform an experimenta…
View article: Making Cross Products and Guarded Ontology Languages Compatible
Making Cross Products and Guarded Ontology Languages Compatible Open
Cross products form a useful modelling tool that allows us to express natural statements such as "elephants are bigger than mice", or, more generally, to define relations that connect every instance in a relation with every instance in ano…
View article: Stable Model Semantics for Tuple-Generating Dependencies Revisited
Stable Model Semantics for Tuple-Generating Dependencies Revisited Open
Normal tuple-generating dependencies (NTGDs) are TGDs enriched with default negation, a.k.a. negation as failure. Query answering under NTGDs, where negation is interpreted according to the stable model semantics, is an intriguing new prob…
View article: Answer Set Solving with Bounded Treewidth Revisited
Answer Set Solving with Bounded Treewidth Revisited Open
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 answer set programming (ASP). To this end, we propose two …
View article: Counting Answer Sets via Dynamic Programming
Counting Answer Sets via Dynamic Programming Open
While the solution counting problem for propositional satisfiability (#SAT) has received renewed attention in recent years, this research trend has not affected other AI solving paradigms like answer set programming (ASP). Although ASP sol…
View article: Guarded-Based Disjunctive Tuple-Generating Dependencies
Guarded-Based Disjunctive Tuple-Generating Dependencies Open
We perform an in-depth complexity analysis of query answering under guarded-based classes of disjunctive tuple-generating dependencies (DTGDs), focusing on (unions of) conjunctive queries ((U)CQs). We show that the problem under investigat…
View article: The power of non-ground rules in Answer Set Programming
The power of non-ground rules in Answer Set Programming Open
Answer set programming (ASP) is a well-established logic programming language that offers an intuitive, declarative syntax for problem solving. In its traditional application, a fixed ASP program for a given problem is designed and the act…