BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:00ffbf8c-8bd2-47c7-95d5-0463fdcf6fce
X-WR-CALNAME:[M2F] Stassa Patsantzis (LaBRI)
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20251026T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20231029T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20241027T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20230326T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20240331T020000
RDATE:20250330T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:00ffbf8c-8bd2-47c7-95d5-0463fdcf6fce
DTSTAMP:20260522T190914Z
CLASS:PUBLIC
DESCRIPTION:** Second-Order SLD-Resolution in Meta-Interpretive Learning **
 \n\nInductive Logic Programming (ILP) is the field that studies approaches
  to the machine learning of logic programs from examples and background kn
 owldge.  Meta-Interpretive Learning (MIL)\, the subject of this talk\, is 
 a new form of ILP capable of learnig arbitrary logic programs with recursi
 on and with invented predicates from very few examples and without the lim
 itations of earlier approaches. What distinguishes MIL from other ILP appr
 oaches is its use of second-order background knowledge and SLD-Resolution 
 as a proof procedure. \nIn this talk I will go briefly over the short hist
 ory of MIL and describe the different stages of its evolution in both theo
 ry and implementation. I will describe the emerging theoretical understand
 ing of MIL as Second-Order SLD-Resolution and the theoretical and practica
 l ramifications of this new understanding. I will sketch out a proof of th
 e inductive soundness and completeness\, and the efficiency\, of Second-Or
 der SLD-Resolution in MIL. I will discuss existing implementations of MIL 
 and their ongoing application to practical problems such as generalised pl
 anning for robotics\, and machine vision currently underway at the Univers
 ity of Surrey. \nFinally\, I will examine potential future applications to
  other classical AI tasks such as formal methods\, verification and model 
 checking. The talk is designed to be accessible to computer scientists wit
 h a background in logic and general knowledge of logic programming and mac
 hine learning.
DTSTART;TZID=Europe/Paris:20240109T140000
DTEND;TZID=Europe/Paris:20240109T150000
LOCATION:LaBRI
SEQUENCE:0
SUMMARY:[M2F] Stassa Patsantzis (LaBRI)
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
