All talks listed in Pacific Time. Schedule subject to change.

–
Coffee and Check-in
–
Opening Remarks
–
Semiring Semantics
Erich Graedel (RWTH Aachen)
–
Break
–
Algorithmic Aspects of Semiring Provenance for Stratified Datalog
Matthias Naaf (RWTH Aachen)
–
Open Discussion (in-person only)
–
Lunch (on your own)
–
Constrained Optimization Over Semirings
Kuldeep Meel (University of Toronto)
–
Semiring-Based Soft Constraint Solving and Argumentation
Stefano Bistarelli (University of Perugia)
–
Break
–
Consistency, Acyclicity, and Positive Semirings
Phokion Kolaitis (UC Santa Cruz and IBM Research)
–
Open Discussion (in-person only)
–
Reception
–
Coffee and Check-in
–
An Introduction to Newton’s Method on Semirings
Javier Esparza (Technische Universität München)
–
Break
–
Understanding Queries by Conditional Instances
Sudeepa Roy (Duke University)
–
Approximating Certain and Possible Answers Beyond Sets
Boris Glavic (Illinois Institute of Technology)
–
Open Discussion (in-person only)
–
Lunch (on your own)
–
Any-k: Ranked enumeration for Dynamic Programming
Nikos Tziavelis (Northeastern University)
–
Direct Access for Conjunctive Queries with Aggregation
Nofar Carmeli (Inria Montpellier)
–
Break
–
Open Discussion (in-person only)
–
Coffee and Check-in
–
Datalog and Equality Saturation
Max Willsey (UC Berkeley)
–
Break
–
Logic and Algebras for Distributed Computing: Applications and Open Questions
Joe Hellerstein (UC Berkeley), Conor Power (UC Berkeley)
–
Open Discussion (in-person only)
–
Lunch (on your own)
–
Deep Learning and the Relational Algebra
Zack Ives (University of Pennsylvania)
–
Factorized Graph Neural Networks (With Some Algebraic Cheating)
Wolfgang Gatterbauer (Northeastern University)
–
Break
–
Scallop: A Language for Neurosymbolic Programming
Mayur Naik (University of Pennsylvania)
–
Open Discussion (in-person only)
–
Coffee and Check-in
–
A (Semi)Ring-Based Query Algebra for Incremental View Maintenance and Query Compilation
Christoph Koch (EPFL)
–
A Unified Approach for Reverse Data Management Problems
Neha Makhija (Northeastern University)
–
Break
–
Circuits for Querying Trees: A Little Survey
Pierre Bourhis (CNRS , CRISTAL)
–
Logical Interfaces to Data, Beyond Views
Michael Benedikt (University of Oxford)
–
Open Discussion (in-person only)
–
Lunch (on your own)
–
Late Breaking Work and Ad Hoc Talks
–
Break
–
Reception at Northeastern/Mills College for Invited Participants
–
Coffee and Check-in
–
Towards Interpretable Data Science
Daniel Deutch (Tel Aviv University)
–
Achieving Understandability and Privacy With Provenance-Based Explanations
Amir Gilad (Hebrew University of Jerusalem)
–
Break
–
Measuring the Importance of Database Elements
Benny Kimelfeld (Technion)
–
Causal Data Integration
Brit Youngmann (MIT)
–
Open Discussion (in-person only)
–
Lunch (on your own)
–
Conclusion and Take-aways (in-person only)