YoVDO

Mobius: Synthesizing Relational Queries with Recursive and Invented Predicates

Offered By: ACM SIGPLAN via YouTube

Tags

Program Synthesis Courses Recursion Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a groundbreaking approach to synthesizing relational queries with recursive and invented predicates in this 18-minute video presentation from OOPSLA2 2023. Delve into the innovative two-step process developed by researchers from the University of Pennsylvania and the University of Southern California. Learn how their tool, Mobius, first synthesizes a non-recursive query consistent with given data, then identifies recursion schemes to generalize to arbitrary data. Discover the iterative predicate unification procedure that leverages data provenance to accelerate convergence. Understand how Mobius outperforms state-of-the-art baselines in both runtime and accuracy on challenging recursive query synthesis tasks. Gain insights into the potential of this fully automated approach for synthesizing complex relational queries and its implications for programming by example and example-guided synthesis.

Syllabus

[OOPSLA23] Mobius: Synthesizing Relational Queries with Recursive and Invented Predicates


Taught by

ACM SIGPLAN

Related Courses

Stanford Seminar - Concepts and Questions as Programs
Stanford University via YouTube
DreamCoder- Growing Generalizable, Interpretable Knowledge With Wake-Sleep Bayesian Program Learning
Yannic Kilcher via YouTube
A Neural Network Solves and Generates Mathematics Problems by Program Synthesis - Paper Explained
Aleksa Gordić - The AI Epiphany via YouTube
EI Seminar - Recent Papers in Embodied Intelligence
Massachusetts Institute of Technology via YouTube
Using Program Synthesis to Build Compilers
Simons Institute via YouTube