Michael Morak

Lukás Chrpa

Theory Pract. Log. Program., 2021

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

[BibT_eX]

[DOI]

Lukás Chrpa

CoRR, 2021

DynASP2.5: Dynamic Programming on Tree Decompositions in Action.

[BibT_eX]

[DOI]

Algorithms, 2021

Sticky Existential Rules and Disjunction are Incompatible.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Universal and Uniform Action Reversibility.

[BibT_eX]

[DOI]

Lukás Chrpa

Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

2020

selp: A Single-Shot Epistemic Logic Program Solver.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2020

The Impact of Treewidth on Grounding and Solving of Answer Set Programs.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2020

lpopt: A Rule Optimization Tool for Answer Set Programming.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2020

On the Reversibility of Actions in Planning.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Structural Decompositions of Epistemic Logic Programs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2019

Helmut Veith memorial workshop 2019 report.

[BibT_eX]

[DOI]

Anna Prianichnikova

Ana Sokolova

ACM SIGLOG News, 2019

Epistemic Logic Programs: A Different World View.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 35th International Conference on Logic Programming (Technical Communications), 2019

Strong Equivalence for Epistemic Logic Programs Made Easy.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

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

[BibT_eX]

[DOI]

CoRR, 2018

Exploiting Treewidth for Projected Model Counting and Its Limits.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

Single-Shot Epistemic Logic Program Solving.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

Stable Model Semantics for Tuple-Generating Dependencies Revisited.

[BibT_eX]

[DOI]

Mario Alviano

Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Answer Set Solving with Bounded Treewidth Revisited.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2017

Making Cross Products and Guarded Ontology Languages Compatible.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

The Impact of Treewidth on ASP Grounding and Solving.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016

The power of non-ground rules in Answer Set Programming.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2016

Guarded-Based Disjunctive Tuple-Generating Dependencies.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2016

Counting Answer Sets via Dynamic Programming.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Recent Advances in Datalog ^\pm.

[BibT_eX]

[DOI]

Georg Gottlob

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.

[BibT_eX]

[DOI]

PhD thesis, 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Rules.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23, 2013

2012

D-FLAT: Declarative problem solving using tree decompositions and answer-set programming.

[BibT_eX]

[DOI]

Bernhard Bliem

Theory Pract. Log. Program., 2012

On the Complexity of Ontological Reasoning under Disjunctive Existential Rules.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming.

[BibT_eX]

[DOI]

Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

Preprocessing of Complex Non-Ground Rules in Answer Set Programming.

[BibT_eX]

[DOI]