University of Cambridge > Talks.cam > Machine Learning Reading Group @ CUED > Logic, Theorem Proving, and Probabilistic Programming

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹ️ Information

Logic, Theorem Proving, and Probabilistic Programming

Download to your calendar using vCal

If you have a question about this talk, please contact Yingzhen Li .

This seminar will give an accessible introduction to logic and declarative programming, along with its theoretical background, practical uses, and relations to machine learning. The talks has three primary aims: (1) to confer key concepts about logical reasoning and how these can be implemented with machines, (2) to empower the audience to solve a wide class of interesting problems using logic programming, (3) to review the current frontier in machine learning, and motivate the search for new fundamental tools (such as probabilistic programming systems).

Along the way, I’ll show how to implement a basic theorem prover, and outline the anatomy of a declarative probabilistic programming language.

Required reading: none.

This talk is part of the Machine Learning Reading Group @ CUED series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Graphene CDT Advanced Technology Lectures Average on weekdays: 9029.81918239 kWh Goldsmiths 1, Lecture Theatre, Department of Materials Science & Metallurgy

Other talks

A novel hereditary encephalopathy in four related Labrador Retrievers associated with a missense variant in the ALDH5A1 gene’ Title to be confirmed Precision psychiatry The organisational management of traumatic stress Group Work The elephant in the room: Machine Learning directly into physical models
 

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