BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260416T202518Z
UID:Seminar-verification-1117@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Patrick Totzke:MAILTO:totzke@liverpool.ac.uk
DTSTART:20230512T110000
DTEND:20230512T120000
SUMMARY:Verification Series
DESCRIPTION:Alexei Lisitsa: Gauss realizability is not so simple and can confuse both humans and AI  \n\nGauss realizability is a concept in topology used in studying planar curves and knots. We apply an experimental approach using constraint satisfaction and logic programming for verification of some recently published simple Gauss realizability criteria and show they are incorrect. We then report on applications of machine learning to the problem of Gauss realizability and demonstrate that ML "is confused'' on the same instances which demonstrated incorrectness above. \n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1117
LOCATION:
END:VEVENT
END:VCALENDAR