Analysis of Lamarckian evolution in morphologically evolving robots. - Milan Jelisavcic; Rafael Kiesel; Kyrre Glette; Evert Haasdijk; A. E. Eiben (ECAL, 2017)

Benefits of lamarckian evolution for morphologically evolving robots. - Milan Jelisavcic; Rafael Kiesel; Kyrre Glette; Evert Haasdijk; A. E. Eiben (GECCO (Companion), 2017)

Preferential Default Reasoning on the Semantic Web. - Rafael Kiesel; Erman Acar; Stefan Schlobach (Description Logics, 2018)

A Mobile Application for Self-Guided Study of Formal Reasoning. - David M. Cerna; Rafael P. D. Kiesel; Alexandra Dzhiganskaya (ThEdu@CADE, 2019)

Weighted LARS for Quantitative Stream Reasoning. - Thomas Eiter; Rafael Kiesel (ECAI, 2020)

ASP(𝓐𝒞): Answer Set Programming with Algebraic Constraints. - Thomas Eiter; Rafael Kiesel (Theory Pract. Log. Program., 2020)

On the Complexity of Sum-of-Products Problems over Semirings. - Thomas Eiter; Rafael Kiesel (AAAI, 2021)

aspmc: An Algebraic Answer Set Counter. - Thomas Eiter; Markus Hecher; Rafael Kiesel (ICLP Workshops, 2021)

Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting. - Thomas Eiter; Markus Hecher; Rafael Kiesel (KR, 2021)

Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures. - Loris Bozzato; Thomas Eiter; Rafael Kiesel (CoRR, 2021)

Quantitative and Stream Extensions of Answer Set Programming. - Rafael Kiesel (ICLP Technical Communications, 2021)

Concurrence for well-formed CAFs: Naive Semantics. - Rafael Kiesel; Anna Rapberger (CoRR, 2021)

Reasoning on Multirelational Contextual Hierarchies via Answer Set Programming with Algebraic Measures. - Loris Bozzato; Thomas Eiter; Rafael Kiesel (Theory Pract. Log. Program., 2021)

Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures (Extended Abstract). - Loris Bozzato; Thomas Eiter; Rafael Kiesel (Description Logics, 2022)

PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT. - Rafael Kiesel; André Schidler (IPEC, 2022)

Efficient Knowledge Compilation Beyond Weighted Model Counting. - Rafael Kiesel; Pietro Totis; Angelika Kimmig (Theory Pract. Log. Program., 2022)

A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets. - Rafael Kiesel; André Schidler (ALENEX, 2023)

Semantically Guided Scene Generation via Contextual Reasoning and Algebraic Measures. - Loris Bozzato; Thomas Eiter; Rafael Kiesel; Daria Stepanova 001 (ICLP Workshops, 2023)

The Impact of Structure in Answer Set Counting: Fighting Cycles and its Limits. - Markus Hecher; Rafael Kiesel (KR, 2023)

Knowledge Compilation and More with SharpSAT-TD. - Rafael Kiesel; Thomas Eiter (KR, 2023)

Contextual Reasoning for Scene Generation (Technical Report). - Loris Bozzato; Thomas Eiter; Rafael Kiesel; Daria Stepanova 001 (CoRR, 2023)

Semiring Reasoning Frameworks in AI and Their Computational Complexity. - Thomas Eiter; Rafael Kiesel (J. Artif. Intell. Res., 2023)

Zeitliche und Quantitative Erweiterungen der Antwortmengenprogrammierung. - Rafael Kiesel (Ausgezeichnete Informatikdissertationen, 2023)

"What if?" in Probabilistic Logic Programming. - Rafael Kiesel; Kilian Rückschloß; Felix Weitkämper (Theory Pract. Log. Program., 2023)

On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? - Markus Hecher; Rafael Kiesel (AAAI, 2024)

aspmc: New frontiers of algebraic answer set counting. - Thomas Eiter; Markus Hecher; Rafael Kiesel (Artif. Intell., 2024)

Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? - Markus Hecher; Rafael Kiesel (CoRR, 2024)

Solving Decision Theory Problems with Probabilistic Answer Set Programming. - Damiano Azzolini; Elena Bellodi; Rafael Kiesel; Fabrizio Riguzzi (Theory Pract. Log. Program., 2025)

Fagin's Theorem for Semiring Turing Machines. - Guillermo Badia; Manfred Droste; Thomas Eiter; Rafael Kiesel; Carles Noguera; Erik Paul (CoRR, 2025)