@misc{FrankKreitz2018,
  author    = {Frank, Mario and Kreitz, Christoph},
  title     = {A theorem prover for scientific and educational purposes},
  series = {Electronic proceedings in theoretical computer science},
  journal   = {Electronic proceedings in theoretical computer science},
  number    = {267},
  publisher = {Open Publishing Association},
  address   = {Sydney},
  issn      = {2075-2180},
  doi       = {10.4204/EPTCS.267.4},
  pages     = {59 -- 69},
  year      = {2018},
  abstract  = {We present a prototype of an integrated reasoning environment for educational purposes. The presented tool is a fragment of a proof assistant and automated theorem prover. We describe the existing and planned functionality of the theorem prover and especially the functionality of the educational fragment. This currently supports working with terms of the untyped lambda calculus and addresses both undergraduate students and researchers. We show how the tool can be used to support the students' understanding of functional programming and discuss general problems related to the process of building theorem proving software that aims at supporting both research and education.},
  language  = {en}
}
@misc{MarquesdeCarvalhoJuergensen2007,
  author    = {Marques de Carvalho, Jackson W. and J{\"u}rgensen, Helmut},
  title     = {Flexible Structured Mathematics Notation : IADIS, International Conference Interfaces and Human Computer Interaction, Lisabon, 2007},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2007, 1},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {5 S.},
  year      = {2007},
  language  = {en}
}
@misc{StoepelSchubertMargariaSteffen2007,
  author    = {St{\"o}pel, Christoph and Schubert, Wolfgang and Margaria-Steffen, Tiziana},
  title     = {Plug-ins und Dienste : Ans{\"a}tze zu Bew{\"a}ltigung zeitvarianter Gesch{\"a}ftsprozesse},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2007, 2},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {14 S.},
  year      = {2007},
  language  = {de}
}
@misc{BordihnNagyVaszil2018,
  author    = {Bordihn, Henning and Nagy, Benedek and Vaszil, Gy{\"o}rgy},
  title     = {Preface: Non-classical models of automata and applications VIII},
  series = {RAIRO-Theoretical informatics and appli and applications},
  volume    = {52},
  journal   = {RAIRO-Theoretical informatics and appli and applications},
  number    = {2-4},
  publisher = {EDP Sciences},
  address   = {Les Ulis},
  issn      = {0988-3754},
  doi       = {10.1051/ita/2018019},
  pages     = {87 -- 88},
  year      = {2018},
  language  = {en}
}
@misc{Przybylla2019,
  author    = {Przybylla, Mareen},
  title     = {Interactive objects in physical computing and their role in the learning process},
  series = {Constructivist foundations},
  volume    = {14},
  journal   = {Constructivist foundations},
  number    = {3},
  publisher = {Vrije Univ.},
  address   = {Bussels},
  issn      = {1782-348X},
  pages     = {264 -- 266},
  year      = {2019},
  abstract  = {The target article discusses the question of how educational makerspaces can become places supportive of knowledge construction. This question is too often neglected by people who run makerspaces, as they mostly explain how to use different tools and focus on the creation of a product. In makerspaces, often pupils also engage in physical computing activities and thus in the creation of interactive artifacts containing embedded systems, such as smart shoes or wristbands, plant monitoring systems or drink mixing machines. This offers the opportunity to reflect on teaching physical computing in computer science education, where similarly often the creation of the product is so strongly focused upon that the reflection of the learning process is pushed into the background.},
  language  = {en}
}
@misc{FichteHecherMeier2019,
  author    = {Fichte, Johannes Klaus and Hecher, Markus and Meier, Arne},
  title     = {Counting Complexity for Reasoning in Abstract Argumentation},
  series = {The Thirty-Third AAAI Conference on Artificial Intelligence, the Thirty-First Innovative Applications of Artificial Intelligence Conference, the Ninth AAAI Symposium on Educational Advances in Artificial Intelligence},
  journal   = {The Thirty-Third AAAI Conference on Artificial Intelligence, the Thirty-First Innovative Applications of Artificial Intelligence Conference, the Ninth AAAI Symposium on Educational Advances in Artificial Intelligence},
  publisher = {AAAI Press},
  address   = {Palo Alto},
  isbn      = {978-1-57735-809-1},
  pages     = {2827 -- 2834},
  year      = {2019},
  abstract  = {In this paper, we consider counting and projected model counting of extensions in abstract argumentation for various semantics. When asking for projected counts we are interested in counting the number of extensions of a given argumentation framework while multiple extensions that are identical when restricted to the projected arguments count as only one projected extension. We establish classical complexity results and parameterized complexity results when the problems are parameterized by treewidth of the undirected argumentation graph. To obtain upper bounds for counting projected extensions, we introduce novel algorithms that exploit small treewidth of the undirected argumentation graph of the input instance by dynamic programming (DP). Our algorithms run in time double or triple exponential in the treewidth depending on the considered semantics. Finally, we take the exponential time hypothesis (ETH) into account and establish lower bounds of bounded treewidth algorithms for counting extensions and projected extension.},
  language  = {en}
}
@misc{SahlmannSchwotzer2018,
  author    = {Sahlmann, Kristina and Schwotzer, Thomas},
  title     = {Ontology-based virtual IoT devices for edge computing},
  series = {Proceedings of the 8th International Conference on the Internet of Things},
  journal   = {Proceedings of the 8th International Conference on the Internet of Things},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  isbn      = {978-1-4503-6564-2},
  doi       = {10.1145/3277593.3277597},
  pages     = {1 -- 7},
  year      = {2018},
  abstract  = {An IoT network may consist of hundreds heterogeneous devices. Some of them may be constrained in terms of memory, power, processing and network capacity. Manual network and service management of IoT devices are challenging. We propose a usage of an ontology for the IoT device descriptions enabling automatic network management as well as service discovery and aggregation. Our IoT architecture approach ensures interoperability using existing standards, i.e. MQTT protocol and SemanticWeb technologies. We herein introduce virtual IoT devices and their semantic framework deployed at the edge of network. As a result, virtual devices are enabled to aggregate capabilities of IoT devices, derive new services by inference, delegate requests/responses and generate events. Furthermore, they can collect and pre-process sensor data. These tasks on the edge computing overcome the shortcomings of the cloud usage regarding siloization, network bandwidth, latency and speed. We validate our proposition by implementing a virtual device on a Raspberry Pi.},
  language  = {en}
}
@misc{BoehneKreitz2018,
  author    = {B{\"o}hne, Sebastian and Kreitz, Christoph},
  title     = {Learning how to prove},
  series = {Electronic proceedings in theoretical computer science},
  journal   = {Electronic proceedings in theoretical computer science},
  number    = {267},
  publisher = {Open Publishing Association},
  address   = {Sydney},
  issn      = {2075-2180},
  doi       = {10.4204/EPTCS.267.1},
  pages     = {1 -- 18},
  year      = {2018},
  abstract  = {We have developed an alternative approach to teaching computer science students how to prove. First, students are taught how to prove theorems with the Coq proof assistant. In a second, more difficult, step students will transfer their acquired skills to the area of textbook proofs. In this article we present a realisation of the second step. Proofs in Coq have a high degree of formality while textbook proofs have only a medium one. Therefore our key idea is to reduce the degree of formality from the level of Coq to textbook proofs in several small steps. For that purpose we introduce three proof styles between Coq and textbook proofs, called line by line comments, weakened line by line comments, and structure faithful proofs. While this article is mostly conceptional we also report on experiences with putting our approach into practise.},
  language  = {en}
}
@misc{Giese2017,
  author    = {Giese, Holger},
  title     = {Formal models and analysis for self-adaptive cyber-physical systems},
  series = {Lecture notes in computer science},
  volume    = {10231},
  journal   = {Lecture notes in computer science},
  editor    = {Kouchnarenko, Olga and Khosravi, Ramtin},
  publisher = {Springer},
  address   = {Cham},
  isbn      = {978-3-319-57666-4},
  issn      = {0302-9743},
  doi       = {10.1007/978-3-319-57666-4_1},
  pages     = {3 -- 9},
  year      = {2017},
  abstract  = {In this extended abstract, we will analyze the current challenges for the envisioned Self-Adaptive CPS. In addition, we will outline our results to approach these challenges with SMARTSOS [10] a generic approach based on extensions of graph transformation systems employing open and adaptive collaborations and models at runtime for trustworthy self-adaptation, self-organization, and evolution of the individual systems and the system-of-systems level taking the independent development, operation, management, and evolution of these systems into account.},
  language  = {en}
}
@misc{SaintDizierStede2017,
  author    = {Saint-Dizier, Patrick and Stede, Manfred},
  title     = {Foundations of the language of argumentation},
  series = {Argument \& computation},
  volume    = {8},
  journal   = {Argument \& computation},
  number    = {2 Special issue},
  publisher = {IOS Press},
  address   = {Amsterdam},
  issn      = {1946-2166},
  doi       = {10.3233/AAC-170018},
  pages     = {91 -- 93},
  year      = {2017},
  language  = {en}
}