Graph-Based Representation and Reasoning: 24th International Conference on Conceptual Structures, ICCS 2019, Marburg, Germany, July 1–4, 2019, Proceedings

288 Pages·2019·16.403 MB·English

by  Dominik Endres, Mehwish Alam, Diana Şotropa

Dominik Endres · Mehwish Alam ·
Diana S¸otropa (Eds.)
Graph-Based
0
Representation
3
5
1
1
I and Reasoning
A
N
L
24th International Conference
on Conceptual Structures, ICCS 2019
Marburg, Germany, July 1–4, 2019, Proceedings
123
fi
Lecture Notes in Arti cial 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
(cid:129) (cid:129)
Ş
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 MehwishAlam
Philipps-UniversitätMarburg 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 Notesin Artificial Intelligence
ISBN 978-3-030-23181-1 ISBN978-3-030-23182-8 (eBook)
https://doi.org/10.1007/978-3-030-23182-8
LNCSSublibrary:SL7–ArtificialIntelligence
©SpringerNatureSwitzerlandAG2019
Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartofthe
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
storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodologynow
knownorhereafterdeveloped.
Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication
doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant
protectivelawsandregulationsandthereforefreeforgeneraluse.
Thepublisher,theauthorsandtheeditorsaresafetoassumethattheadviceandinformationinthisbookare
believedtobetrueandaccurateatthedateofpublication.Neitherthepublishernortheauthorsortheeditors
give a warranty, expressed or implied, with respect to the material contained herein or for any errors or
omissionsthatmayhavebeenmade.Thepublisherremainsneutralwithregardtojurisdictionalclaimsin
publishedmapsandinstitutionalaffiliations.
ThisSpringerimprintispublishedbytheregisteredcompanySpringerNatureSwitzerlandAG
Theregisteredcompanyaddressis:Gewerbestrasse11,6330Cham,Switzerland
Preface
The24theditionoftheInternationalConferenceonConceptualStructures(ICCS2019)
tookplaceinMarburg,Germany,duringJuly1–4,2019.Theoriginsoftheconference
date back to 1993 and since then the research presented at ICCS has focused on
representationofandreasoningwithconceptualstructuresinavarietyofcontexts.This
year’s edition was entitled “Graphs in Human and Machine Cognition.”
Theprogramincludedtwokeynotes:“Visualization,Reasoning,andRationality”by
MarkusKnauff(UniversityofGiessen,Germany)and“TowardsaUnifiedApproachto
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
committeedecidedtoaccept14longpapersandsixshortpapers,whichcorrespondsto
anacceptancerateof50%.Thedecisionforinclusioninthisvolumewastakenafterthe
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.Webelievethisprocedureensuredthatonlyhigh-qualitycontributionswere
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).
Inadditiontotheregularcontributions,thisvolumealsocontainstheabstractsofthe
two keynote talksatICCS 2019along with theabstracts ofthetwotutorialsthat 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 NationalInstituteofStatistics 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,35032Marburg, Germany
[email protected]
Keywords:Patternmatching(cid:1)Eventstreams(cid:1)Situations(cid:1)Time-series(cid:1)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],inwhichaneventstreamconsistsofcontinuouslyarrivingeventseachwitha
timestampandpayloadthatobeyagivenschema(e.g.relationalorRDF).Foragiven
event stream, usually ordered by time, event pattern matching returns all event sub-
sequencesmatchingaregularexpressionofsymbolswithinagiventimewindow.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.,bindingvaluesofaspecificeventoranexpressiontoavariableanduse
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.
Inthiswork,wewilldiscussrecentachievementswith respect topattern matching
andidentifynewchallengingquestionsthatmightalsobeofinterestforresearchersin
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,itisanythingbuttrivialtodefinesymbolsthatarerequiredforspecifyinga
patternquery.Instead,wearguethatusersprefertousethenotionofsituations[3]and
that we need processing systems for interval-based situation streams [4]. A situation
correspondstoaperiodoftimeandanapplicationconceptforwhichasetofconditions
holds true, while an event refers to a timestamp and a technical concept. Consider for
example a car driver and a parking area. A driver is primarily interested in the time
period when a parking space is available, but not the event when a car enter/leave the
parkingarea.Ournotionofsituationsisalsoinagreementwiththeoriginalintentionof
event processing, as it is a paradigm to react to situations of interests (and not to
events). Moreover, the sequential nature of regular expression based patterns has a