Publications of Stefan Ellmauthaler


[1] Stefan Ellmauthaler and Jörg Pührer. Asynchronous multi-context systems. In Thomas Eiter, Hannes Strass, Miroslaw Truszczynski, and Stefan Woltran, editors, Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation - Essays Dedicated to Gerhard Brewka on the Occasion of His 60th Birthday, volume 9060 of Lecture Notes in Computer Science. Springer, 2015. [ bib | DOI | http ]
[2] Stefan Ellmauthaler and Hannes Strass. The DIAMOND system for computing with abstract dialectical frameworks. In Simon Parsons, Nir Oren, Chris Reed, and Federico Cerutti, editors, International Conference on Computational Models of Argument (COMMA 2014), volume 266 of Frontiers in Artificial Intelligence and Applications, pages 233--240. IOS Press, September 2014. [ bib | DOI | .pdf ]
We present diamond, an implementation of Brewka and Woltran's abstract dialectical frameworks (ADFs). The system uses answer set programming encodings to compute interpretations of ADFs according to various semantics. We evaluate the performance of the system using an actual reasoning problem as opposed to using randomly generated frameworks.

[3] Gerhard Brewka, Stefan Ellmauthaler, and Jörg Pührer. Multi-context systems for reactive reasoning in dynamic environments. In Torsten Schaub, Gerhard Friedrich, and Barry O'Sullivan, editors, European Conference on Artificial Intelligence (ECAI 2014), volume 263 of Frontiers in Artificial Intelligence and Applications, pages 159--164. IOS Press, 2014. [ bib | DOI ]
We show in this paper how managed multi-context systems (mMCS) can be turned into a reactive formalism suitable for continuous reasoning in dynamic environments. We extend mMCS with (abstract) sensors and define the notion of a run of the extended systems. We then show how typical problems arising in online reasoning can be addressed: handling potentially inconsistent sensor input, modeling intelligent forms of forgetting, and controlling the reasoning effort spent by contexts. We also investigate the complexity of some important related decision problems.

[4] Gerhard Brewka, Stefan Ellmauthaler, and Jörg Pührer. Mulit-context systems for reactive reasoning in dynamic environments. In Stefan Ellmauthaler and Jörg Pührer, editors, International Workshop on Reactive Concepts in Knowledge Representation (ReactKnow 2014), pages 23--30, 2014. [ bib | http ]
We show in this paper how managed multi-context systems (mMCS) can be turned into a reactive formalism suitable for continuous reasoning in dynamic environments. We extend mMCS with (abstract) sensors and define the notion of a run of the extended systems. We then show how typical problems arising in online reasoning can be addressed: handling potentially inconsistent sensor input, modeling intelligent forms of forgetting, selective integration of knowledge, and controlling the reasoning effort spent by contexts, like setting contexts to an idle mode. We also investigate the complexity of some important related decision problems and discuss different design choices which are given to the knowledge engineer.

[5] Stefan Ellmauthaler and Jörg Pührer. Asynchronous multi-context systems. In Stefan Ellmauthaler and Jörg Pührer, editors, International Workshop on Reactive Concepts in Knowledge Representation (ReactKnow 2014), pages 31--38, 2014. [ bib | http ]
In this work, we present asynchronous multi-context systems (aMCSs), which provide a framework for loosely coupling different knowledge representation formalisms that allows for online reasoning in a dynamic environment. Systems of this kind may interact with the outside world via input and output streams and may therefore react to an continuous flow of external information. In contrast to recent proposals, contexts in an aMCS communicate with each other in an asynchronous way which fits the needs of many application domains and results is beneficial for scalability. The federal semantics of aMCSs render our framework an integration approach rather than a knowledge representation formalism itself. We illustrate the introduced concepts by means of an example scenario dealing with rescue services. In addition we compare aMCSs to reactive multi-context systems and describe how to simulate the latter with our novel approach.

[6] Stefan Ellmauthaler and Hannes Strass. The DIAMOND system for argumentation: Preliminary report. In Michael Fink and Yuliya Lierler, editors, Proceedings of the International Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2013), volume abs/1312.6140, September 2013. [ bib | .pdf ]
Abstract dialectical frameworks (ADFs) are a powerful generalisation of Dung's abstract argumentation frameworks. In this paper we present an answer set programming based software system, called DIAMOND (DIAlectical MOdels eNcoDing). It translates ADFs into answer set programs whose stable models correspond to models of the ADF with respect to several semantics (i.e. admissible, complete, stable, grounded).

[7] Stefan Ellmauthaler. Generalizing multi-context systems for reactive stream reasoning applications. In Andrew V. Jones and Nicholas Ng, editors, Proceedings of the 2013 Imperial College Computing Student Workshop (ICCSW 2013), OpenAccess Series in Informatics (OASIcs), pages 17--24. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, September 2013. [ bib | DOI | http | .pdf ]
In the field of artificial intelligence (AI), the subdomain of knowledge representation (KR) has the aim to represent, integrate, and exchange knowledge in order to do some reasoning about the given information. During the last decades many different KR-languages were proposed for a variety of certain applications with specific needs. The concept of a managed Multi-Context System (mMCS) was introduced to provide adequate formal tools to interchange and integrate knowledge between different KR-approaches. Another arising field of interest in computer science is the design of online applications, which react directly to (possibly infinite) streams of information. This paper presents a genuine approach to generalize mMCS for online applications with continuous streams of information. Our major goal is to find a good tradeoff between expressiveness and computational complexity.

[8] Gerhard Brewka, Stefan Ellmauthaler, Hannes Strass, Johannes Peter Wallner, and Stefan Woltran. Abstract dialectical frameworks revisited. In Francesca Rossi, editor, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 2013). IJCAI/AAAI, August 2013. [ bib | http | .pdf ]
We present various new concepts and results related to abstract dialectical frameworks (adfs), a powerful generalization of Dung's argumentation frameworks (afs). In particular, we show how the existing definitions of stable and preferred semantics which are restricted to the subcase of so-called bipolar adfs can be improved and generalized to arbitrary frameworks. Furthermore, we introduce preference handling methods for adfs, allowing for both reasoning with and about preferences. Finally, we present an implementation based on an encoding in answer set programming.

[9] Stefan Ellmauthaler. Abstract Dialectical Frameworks: Properties, Complexity, and Implementation. Master's thesis, Technische Universität Wien, Institut für Informationssysteme, 2012. [ bib | http ]
Over the last two decades the interest for Abstract Argumentationsteadily raised in the field of Artificial Intelligence. The concept of Dung's Argumentation Frameworks (AFs), where arguments and their relations are represented in a directed graph-structure, is a well-known, simple, and powerful concept. This framework is used to find acceptable sets of arguments, which have specific properties (e.g. being conflict free), defined by several semantics. Recently Abstract Dialectical Frameworks (ADFs) were introduced, a generalization of Dung's approach, to overcome the limitation of attack-relations being the only type of native relations. To reach this goal, in addition to the relations, total functions are used to decide the acceptance of an argument. These functions are so called acceptance conditions. Due to the high expressiveness of this newly proposed theory, some semantics were only generalized for the restricted bipolar ADFs yet. This work will give an exhaustive overview on ADFs. The restriction to bipolar ADFs for some of the semantics is not desired, so we try to develop a solution to gain the generalized stable model semantics. This semantics is particularly important because the other semantics which are restricted to bipolar ADFs, depend on stable models. To gain such a generalization, we will try to connect the foundations of ADFs to other fields of computer science. So we may relate subclasses of these fields to the bipolar ADF to overcome this obstacle. This connection also makes ADFs more accessible to other fields of computer science. We will concentrate mainly on the introduction of the alternative representation of propositional-formula ADFs (pForm-ADFs), but we will also show that ADFs can be represented as hyper-graphs. Based on the new representation a transformation from ADFs to pForm-ADFs, together with a generalization of the stable model semantics will be presented. In addition some properties between semantics will be investigated and an overview of complexity results, enriched with new ones is given. Currently there is no software system available to compute semantics for ADFs. So in addition to the formal results we also present an Answer Set Programming (ASP) based implementation to solve these highly complex computations. We will also present preliminary empirical experiments.

[10] Stefan Ellmauthaler and Johannes Peter Wallner. Evaluating Abstract Dialectical Frameworks with ASP. In Bart Verheij, Stefan Szeider, and Stefan Woltran, editors, International Conference on Computational Models of Argument (COMMA 2012), volume 245, pages 505--506. IOS Press, 2012. [ bib | .pdf ]

This file was generated by bibtex2html 1.97.