Michael Morak

Orcid: 0000-0002-2077-7672

According to our database1, Michael Morak authored at least 45 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Weak and Strong Reversibility of Non-deterministic Actions: Universality and Uniformity.
Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

2023
Solving Projected Model Counting by Utilizing Treewidth and its Limits.
Artif. Intell., 2023

Generative Datalog with Stable Negation.
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

Increasing the Reusability of MOOCs via Competence-Oriented Development.
Proceedings of the IEEE Learning with MOOCS, 2023

Evaluating Epistemic Logic Programs via Answer Set Programming with Quantifiers.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Determining Action Reversibility in STRIPS Using Answer Set Programming with Quantifiers.
Proceedings of the Practical Aspects of Declarative Languages, 2022

2021
Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming.
Theory Pract. Log. Program., 2021

Determining ActionReversibility in STRIPS Using Answer Set and Epistemic Logic Programming.
CoRR, 2021

DynASP2.5: Dynamic Programming on Tree Decompositions in Action.
Algorithms, 2021

Sticky Existential Rules and Disjunction are Incompatible.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Universal and Uniform Action Reversibility.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

2020
selp: A Single-Shot Epistemic Logic Program Solver.
Theory Pract. Log. Program., 2020

The Impact of Treewidth on Grounding and Solving of Answer Set Programs.
J. Artif. Intell. Res., 2020

lpopt: A Rule Optimization Tool for Answer Set Programming.
Fundam. Informaticae, 2020

On the Reversibility of Actions in Planning.
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Structural Decompositions of Epistemic Logic Programs.
Proceedings of the International Conference on Logic Programming 2020 Workshop Proceedings co-located with 36th International Conference on Logic Programming (ICLP 2020), 2020

Determining Action Reversibility in STRIPS Using Answer Set Programming.
Proceedings of the International Conference on Logic Programming 2020 Workshop Proceedings co-located with 36th International Conference on Logic Programming (ICLP 2020), 2020

Determining Action Reversibility in STRIPS Using Epistemic Logic Programs.
Proceedings of the International Conference on Logic Programming 2020 Workshop Proceedings co-located with 36th International Conference on Logic Programming (ICLP 2020), 2020

2019
On Uniform Equivalence of Epistemic Logic Programs.
Theory Pract. Log. Program., 2019

Helmut Veith memorial workshop 2019 report.
ACM SIGLOG News, 2019

Epistemic Logic Programs: A Different World View.
Proceedings of the Proceedings 35th International Conference on Logic Programming (Technical Communications), 2019

Strong Equivalence for Epistemic Logic Programs Made Easy.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version).
CoRR, 2018

Exploiting Treewidth for Projected Model Counting and Its Limits.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

Single-Shot Epistemic Logic Program Solving.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017
Stable Model Semantics for Tuple-Generating Dependencies Revisited.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Answer Set Solving with Bounded Treewidth Revisited.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2017

Making Cross Products and Guarded Ontology Languages Compatible.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

The Impact of Treewidth on ASP Grounding and Solving.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
The power of non-ground rules in Answer Set Programming.
Theory Pract. Log. Program., 2016

Guarded-Based Disjunctive Tuple-Generating Dependencies.
ACM Trans. Database Syst., 2016

Counting Answer Sets via Dynamic Programming.
CoRR, 2016

2015
Recent Advances in Datalog ^\pm.
Proceedings of the Reasoning Web. Web Logic Rules - 11th International Summer School 2015, Berlin, Germany, July 31, 2015

2014
The impact of disjunction on reasoning under existential rules.
PhD thesis, 2014

The Impact of Disjunction on Reasoning under Existential Rules: Research Summary.
CoRR, 2014

Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Rules.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs.
Proceedings of the Informal Proceedings of the 27th International Workshop on Description Logics, 2014

2013
The Impact of Disjunction on Query Answering Under Guarded-Based Existential Rules.
Proceedings of the IJCAI 2013, 2013

2012
D-FLAT: Declarative problem solving using tree decompositions and answer-set programming.
Theory Pract. Log. Program., 2012

On the Complexity of Ontological Reasoning under Disjunctive Existential Rules.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming.
Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

Preprocessing of Complex Non-Ground Rules in Answer Set Programming.
Proceedings of the Technical Communications of the 28th International Conference on Logic Programming, 2012

2011
dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation.
Proceedings of the Applications of Declarative Programming and Knowledge Management, 2011

A New Tree-Decomposition Based Algorithm for Answer Set Programming.
Proceedings of the IEEE 23rd International Conference on Tools with Artificial Intelligence, 2011

2010
A Dynamic-Programming Based ASP-Solver.
Proceedings of the Logics in Artificial Intelligence - 12th European Conference, 2010


  Loading...