The following pages link to Michael Morak (Q1656575):
Displaying 18 items.
- Exploiting treewidth for projected model counting and its limits (Q1656576) (← links)
- Answer set solving with bounded treewidth revisited (Q2401930) (← links)
- Lpopt: a rule optimization tool for answer set programming (Q2409731) (← links)
- Solving projected model counting by utilizing treewidth and its limits (Q2680775) (← links)
- On the Complexity of Ontological Reasoning under Disjunctive Existential Rules (Q2912705) (← links)
- Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Rules (Q2922006) (← links)
- Recent Advances in Datalog$$^\pm $$ (Q2970309) (← links)
- The power of non-ground rules in Answer Set Programming (Q4593042) (← links)
- D-FLAT: Declarative problem solving using tree decompositions and answer-set programming (Q4911127) (← links)
- A Dynamic-Programming Based ASP-Solver (Q4930781) (← links)
- selp: <i>A Single-Shot Epistemic Logic Program Solver</i> (Q4957201) (← links)
- Guarded-Based Disjunctive Tuple-Generating Dependencies (Q5012571) (← links)
- Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming (Q5019605) (← links)
- (Q5020544) (← links)
- On Uniform Equivalence of Epistemic Logic Programs (Q5108505) (← links)
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action (Q5111876) (← links)
- The Impact of Treewidth on Grounding and Solving of Answer Set Programs (Q5208864) (← links)
- Preprocessing of Complex Non-Ground Rules in Answer Set Programming (Q5398063) (← links)
