default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Morak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c34]Jakub Med
, Lukás Chrpa, Michael Morak, Wolfgang Faber:
Weak and Strong Reversibility of Non-deterministic Actions: Universality and Uniformity. ICAPS 2024: 369-377- 2023
- [j11]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Patrick Thier, Stefan Woltran:
Solving Projected Model Counting by Utilizing Treewidth and its Limits. Artif. Intell. 314: 103810 (2023) - [c33]Wolfgang Faber, Michael Morak:
Evaluating Epistemic Logic Programs via Answer Set Programming with Quantifiers. AAAI 2023: 6322-6329 - [c32]Claudia Steinberger, Nina Lobnig, Michael Morak:
Increasing the Reusability of MOOCs via Competence-Oriented Development. LWMOOCS 2023: 1-6 - [c31]Mario Alviano, Matthias Lanzinger, Michael Morak, Andreas Pieris:
Generative Datalog with Stable Negation. PODS 2023: 21-32 - [i16]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Patrick Thier, Stefan Woltran:
Solving Projected Model Counting by Utilizing Treewidth and its Limits. CoRR abs/2305.19212 (2023) - 2022
- [c30]Wolfgang Faber, Michael Morak:
Evaluating Epistemic Logic Programs via Answer Set Programming with Quantifiers. HYDRA/RCRA@LPNMR 2022: 78-89 - [c29]Wolfgang Faber, Michael Morak, Lukás Chrpa:
Determining Action Reversibility in STRIPS Using Answer Set Programming with Quantifiers. PADL 2022: 42-56 - [e3]Joaquín Arias, Roberta Calegari, Luke Dickens, Wolfgang Faber, Jorge Fandinno, Gopal Gupta, Markus Hecher, Daniela Inclezan, Emily LeBlanc, Michael Morak, Elmer Salazar, Jessica Zangari:
Proceedings of the International Conference on Logic Programming 2022 Workshops co-located with the 38th International Conference on Logic Programming (ICLP 2022), Haifa, Israel, July 31st - August 1st, 2022. CEUR Workshop Proceedings 3193, CEUR-WS.org 2022 [contents] - [i15]Mario Alviano, Matthias Lanzinger, Michael Morak, Andreas Pieris:
Generative Datalog with Stable Negation. CoRR abs/2206.12247 (2022) - 2021
- [j10]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
DynASP2.5: Dynamic Programming on Tree Decompositions in Action. Algorithms 14(3): 81 (2021) - [j9]Wolfgang Faber, Michael Morak, Lukás Chrpa:
Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming. Theory Pract. Log. Program. 21(5): 646-662 (2021) - [c28]Lukás Chrpa, Wolfgang Faber, Michael Morak:
Universal and Uniform Action Reversibility. KR 2021: 651-654 - [c27]Michael Morak:
Sticky Existential Rules and Disjunction are Incompatible. KR 2021: 691-695 - [e2]Wolfgang Faber, Gerhard Friedrich, Martin Gebser, Michael Morak:
Logics in Artificial Intelligence - 17th European Conference, JELIA 2021, Virtual Event, May 17-20, 2021, Proceedings. Lecture Notes in Computer Science 12678, Springer 2021, ISBN 978-3-030-75774-8 [contents] - [i14]Wolfgang Faber, Michael Morak, Lukás Chrpa:
Determining ActionReversibility in STRIPS Using Answer Set and Epistemic Logic Programming. CoRR abs/2108.05428 (2021) - 2020
- [j8]Manuel Bichler, Michael Morak, Stefan Woltran:
lpopt: A Rule Optimization Tool for Answer Set Programming. Fundam. Informaticae 177(3-4): 275-296 (2020) - [j7]Bernhard Bliem, Michael Morak, Marius Moldovan, Stefan Woltran:
The Impact of Treewidth on Grounding and Solving of Answer Set Programs. J. Artif. Intell. Res. 67: 35-80 (2020) - [j6]Manuel Bichler, Michael Morak, Stefan Woltran:
selp: A Single-Shot Epistemic Logic Program Solver. Theory Pract. Log. Program. 20(4): 435-455 (2020) - [c26]Markus Hecher, Michael Morak, Stefan Woltran:
Structural Decompositions of Epistemic Logic Programs. AAAI 2020: 2830-2837 - [c25]Wolfgang Faber, Michael Morak:
Determining Action Reversibility in STRIPS Using Epistemic Logic Programs. ICLP Workshops 2020 - [c24]Lukás Chrpa, Wolfgang Faber, Daniel Fiser, Michael Morak:
Determining Action Reversibility in STRIPS Using Answer Set Programming. ICLP Workshops 2020 - [c23]Markus Hecher, Michael Morak, Stefan Woltran:
Structural Decompositions of Epistemic Logic Programs. ICLP Workshops 2020 - [c22]Michael Morak, Lukás Chrpa, Wolfgang Faber, Daniel Fiser:
On the Reversibility of Actions in Planning. KR 2020: 652-661 - [e1]Carmine Dodaro, George Aristidis Elder, Wolfgang Faber, Jorge Fandinno, Martin Gebser, Markus Hecher, Emily LeBlanc, Michael Morak, Jessica Zangari:
International Conference on Logic Programming 2020 Workshop Proceedings co-located with 36th International Conference on Logic Programming (ICLP 2020), Rende, Italy, September 18-19, 2020. CEUR Workshop Proceedings 2678, CEUR-WS.org 2020 [contents] - [i13]Manuel Bichler, Michael Morak, Stefan Woltran:
selp: A Single-Shot Epistemic Logic Program Solver. CoRR abs/2001.01089 (2020) - [i12]Markus Hecher, Michael Morak, Stefan Woltran:
Structural Decompositions of Epistemic Logic Programs. CoRR abs/2001.04219 (2020)
2010 – 2019
- 2019
- [j5]Michael Morak, Anna Prianichnikova, Ana Sokolova:
Helmut Veith memorial workshop 2019 report. ACM SIGLOG News 6(3): 7-8 (2019) - [j4]Wolfgang Faber, Michael Morak, Stefan Woltran:
On Uniform Equivalence of Epistemic Logic Programs. Theory Pract. Log. Program. 19(5-6): 826-840 (2019) - [c21]Wolfgang Faber, Michael Morak, Stefan Woltran:
Strong Equivalence for Epistemic Logic Programs Made Easy. AAAI 2019: 2809-2816 - [c20]Michael Morak:
Epistemic Logic Programs: A Different World View. ICLP Technical Communications 2019: 52-64 - [i11]Wolfgang Faber, Michael Morak, Stefan Woltran:
On Uniform Equivalence of Epistemic Logic Programs. CoRR abs/1907.10925 (2019) - 2018
- [c19]Manuel Bichler, Michael Morak, Stefan Woltran:
Single-Shot Epistemic Logic Program Solving. IJCAI 2018: 1714-1720 - [c18]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
Exploiting Treewidth for Projected Model Counting and Its Limits. SAT 2018: 165-184 - [i10]Johannes Klaus Fichte, Michael Morak, Markus Hecher, Stefan Woltran:
Exploiting Treewidth for Projected Model Counting and its Limits. CoRR abs/1805.05445 (2018) - [i9]Wolfgang Faber, Michael Morak, Stefan Woltran:
Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version). CoRR abs/1811.04800 (2018) - 2017
- [c17]Bernhard Bliem, Marius Moldovan, Michael Morak, Stefan Woltran:
The Impact of Treewidth on ASP Grounding and Solving. IJCAI 2017: 852-858 - [c16]Pierre Bourhis, Michael Morak, Andreas Pieris:
Making Cross Products and Guarded Ontology Languages Compatible. IJCAI 2017: 880-886 - [c15]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
DynASP2.5: Dynamic Programming on Tree Decompositions in Action. IPEC 2017: 17:1-17:13 - [c14]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
Answer Set Solving with Bounded Treewidth Revisited. LPNMR 2017: 132-145 - [c13]Mario Alviano, Michael Morak, Andreas Pieris:
Stable Model Semantics for Tuple-Generating Dependencies Revisited. PODS 2017: 377-388 - [i8]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
Answer Set Solving with Bounded Treewidth Revisited. CoRR abs/1702.02890 (2017) - [i7]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
DynASP2.5: Dynamic Programming on Tree Decompositions in Action. CoRR abs/1706.09370 (2017) - 2016
- [j3]Pierre Bourhis, Marco Manna, Michael Morak, Andreas Pieris:
Guarded-Based Disjunctive Tuple-Generating Dependencies. ACM Trans. Database Syst. 41(4): 27:1-27:45 (2016) - [j2]Manuel Bichler, Michael Morak, Stefan Woltran:
The power of non-ground rules in Answer Set Programming. Theory Pract. Log. Program. 16(5-6): 552-569 (2016) - [c12]Manuel Bichler, Michael Morak, Stefan Woltran:
lpopt: A Rule Optimization Tool for Answer Set Programming. LOPSTR 2016: 114-130 - [i6]Manuel Bichler, Michael Morak, Stefan Woltran:
The Power of Non-Ground Rules in Answer Set Programming. CoRR abs/1608.01856 (2016) - [i5]Manuel Bichler, Michael Morak, Stefan Woltran:
lpopt: A Rule Optimization Tool for Answer Set Programming. CoRR abs/1608.05675 (2016) - [i4]Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran:
Counting Answer Sets via Dynamic Programming. CoRR abs/1612.07601 (2016) - 2015
- [c11]Georg Gottlob, Michael Morak, Andreas Pieris:
Recent Advances in Datalog ^\pm. Reasoning Web 2015: 193-217 - 2014
- [b1]Michael Morak:
The impact of disjunction on reasoning under existential rules. University of Oxford, UK, 2014 - [c10]Pierre Bourhis, Michael Morak, Andreas Pieris:
Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs. Description Logics 2014: 100-111 - [c9]Pierre Bourhis, Michael Morak, Andreas Pieris:
Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Rules. MFCS (1) 2014: 99-110 - [i3]Michael Morak:
The Impact of Disjunction on Reasoning under Existential Rules: Research Summary. CoRR abs/1405.5109 (2014) - 2013
- [c8]Pierre Bourhis, Michael Morak, Andreas Pieris:
The Impact of Disjunction on Query Answering Under Guarded-Based Existential Rules. Description Logics 2013: 539-551 - [c7]Pierre Bourhis, Michael Morak, Andreas Pieris:
The Impact of Disjunction on Query Answering Under Guarded-Based Existential Rules. IJCAI 2013: 796-802 - 2012
- [j1]Bernhard Bliem, Michael Morak, Stefan Woltran:
D-FLAT: Declarative problem solving using tree decompositions and answer-set programming. Theory Pract. Log. Program. 12(4-5): 445-464 (2012) - [c6]Michael Morak, Stefan Woltran:
Preprocessing of Complex Non-Ground Rules in Answer Set Programming. ICLP (Technical Communications) 2012: 247-258 - [c5]Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming. LION 2012: 130-144 - [c4]Georg Gottlob, Marco Manna, Michael Morak, Andreas Pieris:
On the Complexity of Ontological Reasoning under Disjunctive Existential Rules. MFCS 2012: 1-18 - [i2]Bernhard Bliem, Michael Morak, Stefan Woltran:
D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming. CoRR abs/1210.1931 (2012) - 2011
- [c3]Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
A New Tree-Decomposition Based Algorithm for Answer Set Programming. ICTAI 2011: 916-918 - [c2]Wolfgang Dvorák, Michael Morak, Clemens Nopp, Stefan Woltran:
dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation. INAP/WLP 2011: 259-268 - [i1]Wolfgang Dvorák, Michael Morak, Clemens Nopp, Stefan Woltran:
dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation. CoRR abs/1108.4804 (2011) - 2010
- [c1]Michael Morak, Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
A Dynamic-Programming Based ASP-Solver. JELIA 2010: 369-372
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
