University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Meta-interpretive learning logic programs

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Meta-interpretive learning logic programs

Download to your calendar using vCal

  • UserAndrew Crooper, University of Oxford
  • ClockThursday 03 May 2018, 14:00-15:00
  • HouseFW11.

If you have a question about this talk, please contact Victor Gomes .

This talk has been canceled/deleted

Meta-interpretive learning (MIL) is a form of machine learning which induces logic programs from examples. MIL is based on a Prolog meta-interpreter but additionally resolves goals with higher-order Horn clauses, and saves the higher-order substitutions to form logic programs. A basic MIL learner is only around 40 lines of Prolog and is able to learn a wide range of recursive programs, such as sorting algorithms and robot strategies. I will give an overview of MIL , including recent work on learning higher-order programs and learning minimal time-complexity programs.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

This talk is included in these lists:

  • This talk is not included in any other list

Note that ex-directory lists are not shown.

Other lists

Average on Sundays: 7431.15306122 kWh SS03, William Gates Building. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon CCIMI Short Course: Tamara Broderick (MIT)

Other talks

Teams Announced Discovery Investigations: Science, Empire and the Making of the British South Atlantic Title tbc Polar Oceans Seminar Talk Cambridge RNA Club - ONLINE Title to be confirmed
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity