Stefan Ellmauthaler
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Stefan Ellmauthaler has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Gerhard Brewka
Leipzig University
3 shared publications - João Leite
NOVA School of Science and Technology NOVA LINCS NOVA University Lisbon Portugal
3 shared publications - Matthias Knorr
Universidade Nova de Lisboa
3 shared publications - Ricardo Gonçalves
Universidade Nova de Lisboa
3 shared publications Jörg Pührer
2 shared publications- Sarah Alice Gaggl
Logic Programming and Argumentation Group, TU Dresden, Germany
2 shared publications
Latest Publications
- Open Access
- 1 July 2024
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 24 (4) , 772-789
Winning Snake: Design Choices in Multi-Shot ASP
Answer set programming is a well-understood and established problem-solving and knowledge representation paradigm. It has become more prominent amongst a wider audience due to its multiple applications in science and industry. The constant development of advanced programming and modeling techniques extends the toolset for developers and users regularly. This paper compiles and demonstrates different techniques to reuse logic program parts (multi-shot) by solving the arcade game snake. This game is particularly interesting because a victory can be assured by solving the NP-hard problem of Hamiltonian Cycles. We will demonstrate five hands-on implementations in clingo and compare their performance in an empirical evaluation. In addition, our implementation utilizes clingraph to generate a simple yet informative image representation of the game’s progress.
- 1 July 2024
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 24 (4) , 772-789
Open AccessWinning Snake: Design Choices in Multi-Shot ASP
Answer set programming is a well-understood and established problem-solving and knowledge representation paradigm. It has become more prominent amongst a wider audience due to its multiple applications in science and industry. The constant development of advanced programming and modeling techniques extends the toolset for developers and users regularly. This paper compiles and demonstrates different techniques to reuse logic program parts (multi-shot) by solving the arcade game snake. This game is particularly interesting because a victory can be assured by solving the NP-hard problem of Hamiltonian Cycles. We will demonstrate five hands-on implementations in clingo and compare their performance in an empirical evaluation. In addition, our implementation utilizes clingraph to generate a simple yet informative image representation of the game’s progress.
- 29 August 2022
- Published by Springer Nature
- p. 177-189
Representing Abstract Dialectical Frameworks with Binary Decision Diagrams
- 29 August 2022
- Published by Springer Nature
- p. 177-189
Representing Abstract Dialectical Frameworks with Binary Decision Diagrams
- 15 February 2019
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 19 (2) , 109-113
Introduction to the TPLP Special Issue on User-oriented Logic Programming and Reasoning Paradigms
With the rise of machine learning, and more recently the overwhelming interest in deep learning, knowledge representation and reasoning (KRR) approaches struggle to maintain their position within the wider Artificial Intelligence (AI) community. Often considered as part of thegood old-fashioned AI(Haugeland 1985) – like a memory of glorious old days that have come to an end – many consider KRR as no longer applicable (on its own) to the problems faced by AI today (Blackwell 2015; Garneloet al.2016). What they see are logical languages with symbols incomprehensible by most, inference mechanisms that even experts have difficulties tracing and debugging, and the incapability to process unstructured data like text.
- 15 February 2019
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 19 (2) , 109-113
Introduction to the TPLP Special Issue on User-oriented Logic Programming and Reasoning Paradigms
With the rise of machine learning, and more recently the overwhelming interest in deep learning, knowledge representation and reasoning (KRR) approaches struggle to maintain their position within the wider Artificial Intelligence (AI) community. Often considered as part of thegood old-fashioned AI(Haugeland 1985) – like a memory of glorious old days that have come to an end – many consider KRR as no longer applicable (on its own) to the problems faced by AI today (Blackwell 2015; Garneloet al.2016). What they see are logical languages with symbols incomprehensible by most, inference mechanisms that even experts have difficulties tracing and debugging, and the incapability to process unstructured data like text.
- 17 December 2018
- Published by Springer Nature in KI - Künstliche Intelligenz
- Vol. 33 (1) , 101-104
Multi-Context Reasoning in Continuous Data-Flow Environments
- 17 December 2018
- Published by Springer Nature in KI - Künstliche Intelligenz
- Vol. 33 (1) , 101-104
Multi-Context Reasoning in Continuous Data-Flow Environments
- 17 May 2018
- Published by Springer Nature in KI - Künstliche Intelligenz
- Vol. 32 (2-3) , 199-200
Advanced Solving Technology for Dynamic and Reactive Applications
- 17 May 2018
- Published by Springer Nature in KI - Künstliche Intelligenz
- Vol. 32 (2-3) , 199-200
Advanced Solving Technology for Dynamic and Reactive Applications
- 1 March 2018
- Published by Elsevier in Artificial Intelligence
- Vol. 256, 68-104
Reactive multi-context systems: Heterogeneous reasoning in dynamic environments
- 1 March 2018
- Published by Elsevier in Artificial Intelligence
- Vol. 256, 68-104
Reactive multi-context systems: Heterogeneous reasoning in dynamic environments
- Open Access
Reactive Multi-Context Systems: Heterogeneous Reasoning in Dynamic Environments
Managed multi-context systems (mMCSs) allow for the integration of heterogeneous knowledge sources in a modular and very general way. They were, however, mainly designed for static scenarios and are therefore not well-suited for dynamic environments in which continuous reasoning over such heterogeneous knowledge with constantly arriving streams of data is necessary. In this paper, we introduce reactive multi-context systems (rMCSs), a framework for reactive reasoning in the presence of heterogeneous knowledge sources and data streams. We show that rMCSs are indeed well-suited for this purpose by illustrating how several typical problems arising in the context of stream reasoning can be handled using them, by showing how inconsistencies possibly occurring in the integration of multiple knowledge sources can be handled, and by arguing that the potential non-determinism of rMCSs can be avoided if needed using an alternative, more skeptical well-founded semantics instead with beneficial computational properties. We also investigate the computational complexity of various reasoning problems related to rMCSs. Finally, we discuss related work, and show that rMCSs do not only generalize mMCSs to dynamic settings, but also capture/extend relevant approaches w.r.t. dynamics in knowledge representation and stream reasoning.
Open AccessReactive Multi-Context Systems: Heterogeneous Reasoning in Dynamic Environments
Managed multi-context systems (mMCSs) allow for the integration of heterogeneous knowledge sources in a modular and very general way. They were, however, mainly designed for static scenarios and are therefore not well-suited for dynamic environments in which continuous reasoning over such heterogeneous knowledge with constantly arriving streams of data is necessary. In this paper, we introduce reactive multi-context systems (rMCSs), a framework for reactive reasoning in the presence of heterogeneous knowledge sources and data streams. We show that rMCSs are indeed well-suited for this purpose by illustrating how several typical problems arising in the context of stream reasoning can be handled using them, by showing how inconsistencies possibly occurring in the integration of multiple knowledge sources can be handled, and by arguing that the potential non-determinism of rMCSs can be avoided if needed using an alternative, more skeptical well-founded semantics instead with beneficial computational properties. We also investigate the computational complexity of various reasoning problems related to rMCSs. Finally, we discuss related work, and show that rMCSs do not only generalize mMCSs to dynamic settings, but also capture/extend relevant approaches w.r.t. dynamics in knowledge representation and stream reasoning.
- 1 November 2016
- Published by Springer Nature
- p. 529-535
Inconsistency Management in Reactive Multi-context Systems
- 1 November 2016
- Published by Springer Nature
- p. 529-535
Inconsistency Management in Reactive Multi-context Systems