@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{BrewkaSchaubWoltran2018,
  author    = {Brewka, Gerhard and Schaub, Torsten H. and Woltran, Stefan},
  title     = {Interview with Gerhard Brewka},
  series = {K{\"u}nstliche Intelligenz},
  volume    = {32},
  journal   = {K{\"u}nstliche Intelligenz},
  number    = {2-3},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {0933-1875},
  doi       = {10.1007/s13218-018-0549-5},
  pages     = {219 -- 221},
  year      = {2018},
  abstract  = {This interview with Gerhard Brewka was conducted by correspondance in May 2018. The question set was compiled by Torsten Schaub and Stefan Woltran.},
  language  = {en}
}
@misc{BosserCabalarDieguezetal.2018,
  author    = {Bosser, Anne-Gwenn and Cabalar, Pedro and Dieguez, Martin and Schaub, Torsten H.},
  title     = {Introducing temporal stable models for linear dynamic logic},
  series = {16th International Conference on Principles of Knowledge Representation and Reasoning},
  journal   = {16th International Conference on Principles of Knowledge Representation and Reasoning},
  publisher = {ASSOC Association for the Advancement of Artificial Intelligence},
  address   = {Palo Alto},
  pages     = {12 -- 21},
  year      = {2018},
  abstract  = {We propose a new temporal extension of the logic of Here-and-There (HT) and its equilibria obtained by combining it with dynamic logic over (linear) traces. Unlike previous temporal extensions of HT based on linear temporal logic, the dynamic logic features allow us to reason about the composition of actions. For instance, this can be used to exercise fine grained control when planning in robotics, as exemplified by GOLOG. In this paper, we lay the foundations of our approach, and refer to it as Linear Dynamic Equilibrium Logic, or simply DEL. We start by developing the formal framework of DEL and provide relevant characteristic results. Among them, we elaborate upon the relationships to traditional linear dynamic logic and previous temporal extensions of HT.},
  language  = {en}
}
@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{AlhosseiniAlmodarresiYasinBinTareafNajafietal.2019,
  author    = {Alhosseini Almodarresi Yasin, Seyed Ali and Bin Tareaf, Raad and Najafi, Pejman and Meinel, Christoph},
  title     = {Detect me if you can},
  series = {Companion Proceedings of The 2019 World Wide Web Conference},
  journal   = {Companion Proceedings of The 2019 World Wide Web Conference},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  isbn      = {978-1-4503-6675-5},
  doi       = {10.1145/3308560.3316504},
  pages     = {148 -- 153},
  year      = {2019},
  abstract  = {Spam Bots have become a threat to online social networks with their malicious behavior, posting misinformation messages and influencing online platforms to fulfill their motives. As spam bots have become more advanced over time, creating algorithms to identify bots remains an open challenge. Learning low-dimensional embeddings for nodes in graph structured data has proven to be useful in various domains. In this paper, we propose a model based on graph convolutional neural networks (GCNN) for spam bot detection. Our hypothesis is that to better detect spam bots, in addition to defining a features set, the social graph must also be taken into consideration. GCNNs are able to leverage both the features of a node and aggregate the features of a node's neighborhood. We compare our approach, with two methods that work solely on a features set and on the structure of the graph. To our knowledge, this work is the first attempt of using graph convolutional neural networks in spam bot detection.},
  language  = {en}
}
@misc{OPUS4-33848,
  title     = {Design thinking : understand - improve - apply},
  editor    = {Plattner, Hasso and Meinel, Christoph and Leifer, Larry},
  publisher = {Springer-Verlag Berlin Heidelberg},
  address   = {Berlin, Heidelberg},
  isbn      = {978-3-642-13756-3},
  pages     = {236 S.},
  year      = {2011},
  language  = {en}
}