YoVDO

Disequalities in E-Graphs: An Experiment

Offered By: ACM SIGPLAN via YouTube

Tags

Computer Science Courses Logic Courses Formal Methods Courses E-Graphs Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the integration of disequalities into e-graphs for enhancing automated theorem provers in this 25-minute video presentation from the EGRAPHS 2024 workshop. Delve into two existing approaches implemented in the egg e-graph library, examining preliminary results on their effectiveness. Learn about the feasibility of integrating disequalities into e-graphs using egg, with promising findings suggesting improved efficiency in proof search algorithms. Discover the researchers' plans to refine this approach, integrate it into the Propel automated theorem prover, and make their extensions to egg available to the research community. Gain insights from George Zakhour, Pascal Weisenburger, and Guido Salvaneschi from the University of St. Gallen as they present their experiment on disequalities in e-graphs.

Syllabus

[EGRAPHS24] Disequalities in E-Graphs: An Experiment


Taught by

ACM SIGPLAN

Related Courses

Introduction to Logic
Stanford University via Coursera
Lógica y usos
Miríadax
Comprendre les Microcontroleurs
École Polytechnique Fédérale de Lausanne via Coursera
Logic: Language and Information 1
University of Melbourne via Coursera
Logic: Language and Information 2
University of Melbourne via Coursera