Graph-Based Representation and Reasoning 24Th International Conference on Conceptual Structures, ICCS 2019 Marburg, Germany, July 1–4, 2019 Proceedings
Total Page:16
File Type:pdf, Size:1020Kb
Lecture Notes in Artificial Intelligence 11530 Subseries of Lecture Notes in Computer Science Series Editors Randy Goebel University of Alberta, Edmonton, Canada Yuzuru Tanaka Hokkaido University, Sapporo, Japan Wolfgang Wahlster DFKI and Saarland University, Saarbrücken, Germany Founding Editor Jörg Siekmann DFKI and Saarland University, Saarbrücken, Germany More information about this series at http://www.springer.com/series/1244 Dominik Endres • Mehwish Alam • Diana Şotropa (Eds.) Graph-Based Representation and Reasoning 24th International Conference on Conceptual Structures, ICCS 2019 Marburg, Germany, July 1–4, 2019 Proceedings 123 Editors Dominik Endres Mehwish Alam Philipps-Universität Marburg FIZ Karlsruhe – Leibniz Institute Marburg, Germany for Information Infrastructure Eggenstein-Leopoldshafen, Germany Diana Şotropa Babes-Bolyai University Cluj-Napoca, Romania ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notes in Artificial Intelligence ISBN 978-3-030-23181-1 ISBN 978-3-030-23182-8 (eBook) https://doi.org/10.1007/978-3-030-23182-8 LNCS Sublibrary: SL7 – Artificial Intelligence © Springer Nature Switzerland AG 2019 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, expressed or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. This Springer imprint is published by the registered company Springer Nature Switzerland AG The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland Preface The 24th edition of the International Conference on Conceptual Structures (ICCS 2019) took place in Marburg, Germany, during July 1–4, 2019. The origins of the conference date back to 1993 and since then the research presented at ICCS has focused on representation of and reasoning with conceptual structures in a variety of contexts. This year’s edition was entitled “Graphs in Human and Machine Cognition.” The program included two keynotes: “Visualization, Reasoning, and Rationality” by Markus Knauff (University of Giessen, Germany) and “Towards a Unified Approach to Pattern Matching for Event Streams, Time Series, and Graphs” by Bernhard Seeger (University of Marburg, Germany). There were 29 submissions. Each submission was reviewed by at least two, and on average 2.9, Program Committee members. The committee decided to accept 14 long papers and six short papers, which corresponds to an acceptance rate of 50%. The decision for inclusion in this volume was taken after the authors had the chance to submit a rebuttal to their initial reviews. For the purpose of the presentation at the conference, we divided the accepted submissions into eight regular sessions and one poster session, where the short papers and posters were presented. We believe this procedure ensured that only high-quality contributions were presented at the conference. This year, we are happy to announce that two tutorials were presented at the conference: “Inference in Statistical Relational AI,” by Tanya Braun and Marcel Gehrke (University of Lübeck) and “An Invitation to Formal Concept Analysis” by Tom Hanika (University of Kassel). In addition to the regular contributions, this volume also contains the abstracts of the two keynote talks at ICCS 2019 along with the abstracts of the two tutorials that were held by members of ICCS community. As general chair and program chairs, we would like to thank the Program Com- mittee members and additional reviewers for their work. Without their substantial voluntary contribution it would have been impossible to ensure a high-quality con- ference program. We want to express our gratitude to the local organizers, who made sure that the conference ran smoothly and was a pleasant experience for all its par- ticipants. We would also like to thank Springer, EasyChair, and our supporter “Information — An Open Access Journal from MDPI.” Our institutions, Philipps-Universität Marburg, Germany, the FIZ Karlsruhe - Leibniz Institute for Information Infrastructure, Karlsruhe, Germany, and Babes-Bolyai University, Cluj-Napoca, Romania, also provided support for our participation, for which we are grateful. Lastly, we thank the ICCS Steering Committee for their continual support, advice, and encouragement. July 2019 Dominik Endres Mehwish Alam Diana Şotropa Organization Program Committee Mehwish Alam FIZ Karlsrube - Leibniz Institute for Information Infrastructure, AIFB Institute, KIT, Germany Simon Andrews Sheffield Hallam University, UK Moulin Bernard Laval University, Canada Tanya Braun University of Lübeck, Germany Peggy Cellier IRISA/INSA Rennes, France Olivier Corby Inria, France Diana Cristea Babes-Bolyai University, Romania Madalina Croitoru LIRMM, University of Montpellier II, France Licong Cui The University of Texas Health Science Center at Houston, USA Juliette Dibie-Barthélemy AgroParisTech, France Florent Domenach Akita International University, Japan Dominik Endres Philipps-Universität Marburg, Germany Jérôme Euzenat Inria and University of Grenoble Alpes, France Catherine Faron Zucker Université Nice Sophia Antipolis, France Marcel Gehrke University of Lübeck, Germany Ollivier Haemmerlé IRIT, University of Toulouse le Mirail, France John Howse University of Brighton, UK Dmitry Ignatov National Research University Higher School of Economics, Russia Mateja Jamnik University of Cambridge, UK Adil Kabbaj National Institute of Statistics and Applied Economics, Morocco Hamamache Kheddouci University Claude Bernard, France Leonard Kwuida Bern University of Applied Sciences, Switzerland Steffen Lohmann Fraunhofer, Germany Philippe Martin Sciences Po and CEPR, France Amedeo Napoli LORIA Nancy, CNRS, Inria, University of Lorraine, France Sergei Obiedkov Higher School of Economics, Russia Heather D. Pfeiffer Akamai Physics, Inc., USA Simon Polovina Sheffield Hallam University, UK Uta Priss Ostfalia University of Applied Sciences, Germany Christian Sacarea Babes-Bolyai University, Romania Eric Salvat IMERIR, France Iain Stalker University of Manchester, UK viii Organization Gem Stapleton University of Brighton, UK Diana Şotropa Babes-Bolyai University, Romania Additional Reviewers Chapman, Peter Quafafou, Mohamed Raggi, Daniel Shams, Zohreh Thiéblin, Elodie Zheng, Fengbo Zhu, Wei Abstracts of the Invited Talks Recent Trends in Pattern Matching on Temporal Streams and Time Series Bernhard Seeger University of Marburg, Hans-Meerwein-Str. 6, 35032 Marburg, Germany [email protected] Keywords: Pattern matching Á Event streams Á Situations Á Time-series Á Graphs Extended Abstract The term pattern matching is often used with very different meanings in various areas of computer science and other scientific disciplines. In computer science, pattern matching is best known from the seminal works on string searching [1]. Pattern matching is also one of the most important operators in event stream processing sys- tems [2], in which an event stream consists of continuously arriving events each with a timestamp and payload that obey a given schema (e.g. relational or RDF). For a given event stream, usually ordered by time, event pattern matching returns all event sub- sequences matching a regular expression of symbols within a given time window. More precisely, event pattern matching on event streams comprises two steps. First, the incoming events are mapped to symbols using Boolean expressions on the events’ payload, before the resulting symbol stream is matched using some kind of regular expression. In contrast to traditional regular expressions, event pattern matching also provides advanced features like accessing previously matched events or variable bindings, i.e., binding values of a specific event or an expression to a variable and use this variable in subsequent symbol definitions again. This leads to an operator with high expressiveness, but also makes the definition of the symbols a non-trivial task. In this work, we will discuss recent achievements with respect to pattern matching and identify new challenging questions that might also be of interest for researchers in the area of analysis and representation of conceptual knowledge. We first question whether event processing is indeed a suitable abstraction level for users. As already mentioned, it is anything but trivial to define symbols that are required for specifying a pattern query. Instead, we argue that users prefer to use the notion of situations [3] and that we need processing systems for interval-based situation streams [4]. A situation corresponds to a period of