BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260911T202016Z
UID:Seminar-dept-378@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20150430T130000
DTEND:20150430T140000
SUMMARY:School Seminar Series
DESCRIPTION:Dr Temur Kutsia: Anti-Unification: Algorithms and Applications\n\nThe anti-unification problem of two terms t1 and t2 is concerned with finding a term t which generalizes both t1 and t2. That is, the input terms should be substitution instances of the generalization term. Interesting generalizations are the least general ones. The purpose of anti-unification algorithms is to compute such least general generalizations.\n\n\n\nResearch on anti-unification has been initiated in the 1970s, with the works by Gordon Plotkin and John C. Reynolds. Since then, a number of algorithms and their modifications have been developed, addressing the problem in first-order or higher-order languages, for syntactic or equational theories, over ranked or unranked alphabets, with or without sorts/types, etc. Anti-unification has found applications in machine learning, inductive logic programming, case-based reasoning, analogy making, symbolic mathematical computing, program analysis, synthesis, transformation, verification, etc. After briefly reviewing some of these algorithms and applications, we will discuss recent developments in unranked and nominal generalization computation.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=378
LOCATION:Ashton Lecture Theater
END:VEVENT
END:VCALENDAR