Michael Morak

Available identifiers

Publication	Date of Publication	Type
Solving projected model counting by utilizing treewidth and its limits	2023-01-04	Paper
Determining action reversibility in STRIPS using answer set and epistemic logic programming	2022-01-10	Paper
https://portal.mardi4nfdi.de/entity/Q5020544	2022-01-06	Paper
Guarded-based disjunctive tuple-generating dependencies	2021-11-25	Paper
selp: a single-shot epistemic logic program solver	2021-09-03	Paper
lpopt: a rule optimization tool for answer set programming	2021-05-20	Paper
DynASP2.5: Dynamic Programming on Tree Decompositions in Action	2020-05-27	Paper
On uniform equivalence of epistemic logic programs	2020-05-04	Paper
The impact of treewidth on grounding and solving of answer set programs	2020-01-22	Paper
Exploiting treewidth for projected model counting and its limits	2018-08-10	Paper
The power of non-ground rules in Answer Set Programming	2017-11-09	Paper
Lpopt: a rule optimization tool for answer set programming	2017-10-13	Paper
Answer set solving with bounded treewidth revisited	2017-09-05	Paper
Recent advances in Datalog\(^\pm \)	2017-03-30	Paper
Towards efficient reasoning under guarded-based disjunctive existential rules	2014-10-14	Paper
Preprocessing of complex non-ground rules in answer set programming	2014-02-25	Paper
D-FLAT: declarative problem solving using tree decompositions and answer-set programming	2013-03-13	Paper
On the complexity of ontological reasoning under disjunctive existential rules	2012-09-25	Paper
A dynamic-programming based ASP-solver	2010-10-01	Paper

This page was built for person: Michael Morak