Disequalities in E-Graphs: An Experiment
Offered By: ACM SIGPLAN via YouTube
Course Description
Overview
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
Unleashing Algebraic Metaprogramming in Julia with Metatheory.jlThe Julia Programming Language via YouTube Gatlab - Combining Computer Algebra and Standard ML Modules
The Julia Programming Language via YouTube E-graphs and Automated Reasoning: Looking Back to Look Forward
ACM SIGPLAN via YouTube Automated Proof Generation for Associative and Distributive Rewriting with E-Graphs
ACM SIGPLAN via YouTube EGSTRA: E-Graph-Based Strategy for Test Suite Reduction and Abstraction
ACM SIGPLAN via YouTube