–
Coffee and Check-in
–
Opening Remarks
–
Talk by
Dan Suciu (University of Washington)
–
The Intensional-Extensional Problem in Probabilistic Databases
Mikael Monet (INRIA)
–
Break
–
Talk by
Kuldeep Singh (National University of Singapore)
–
Lunch (on your own)
–
Towards Using Probabilistic Logic Assessments via Credal Probabilistic Circuits
Cassio de Campos (TU Eindhoven)
–
Probabilistic flow circuits
Sriraam Natarajan (UT Dallas)
–
Break
–
Discussion
–
Reception
–
Coffee and Check-in
–
AND/OR search spaces: How probabilistic reasoning meets heuristic search
Rina Dechter (UC Irvine)
–
First-Order Model Counting and Sampling
Ondrej Kuzelka (Prague University)
–
Break
–
Combined Approximations for Probabilistic Query Evaluation: An Intensional Approach
Timothy Van Bremen (National University of Singapore)
–
Lunch (on your own)
–
Tractable Bounding of Counterfactual Queries by Knowledge Compilation
Alessandro Antonucci (IDSIA)
–
Lower Bounds for Tractable Arithmetic Circuits
Alexis de Colnet (TU Wien)
–
Break
–
Discussion
–
Coffee and Check-in
–
Talk by
Antoine Amarili (Telecom Paris)
–
Leveraging tree automata approximation results for efficient sampling and counting in Boolean circuits
Marcelo Arenas (PUC Chile and RelationalAI)
–
Break
–
Direct Access for Conjunctive Queries with Negation
Florent Capelli (Université d'Artois, CNRS, CRIL)
–
Lunch (on your own)
–
Talk by
Ahmet Kara (University of Zurich )
–
Talk by
YooJung Choi (Arizona State University)
–
Break
–
Discussion
–
Coffee and Check-in
–
The Extended Algebraic Decision Diagram (XADD) and its Application to Discrete+Continuous Inference and Optimization
Scott Sanner (University of Toronto)
–
Hybrid Inference in Circuits
Robert Peharz (TU Graz)
–
Break
–
Negative mixture models
Antonio Vergari (University of Edinburgh)
–
Lunch (on your own)
–
An Approximate Skolem Function Counter
Brendan Juba (Washington University in St. Louis)
–
Tractable Computation of Expected Kernels by Circuit Representations
Zhe Zeng (UCLA)
–
Break
–
Discussion
–
Coffee and Check-in
–
Marginal Determinism in Structured Decomposable Circuits
Benjie Wang (University of Oxford)
–
Talk by
Denis Maua (University of Sao Paulo)
–
Break
–
Talk by
Honghua Zhang (UCLA)
–
Lunch (on your own)
–
Talk by
Weiming Feng (University of Edinburgh)
–
Talk by
Markus Hecher (MIT)
–
Discussion
–
Closing
Register

Registration is required to attend this workshop in person. Space may be limited, and you are advised to register early. To submit your name for consideration, please register and await confirmation of your acceptance before booking your travel. 

For additional information please visit: https://simons.berkeley.edu/participating-workshop.

Please note: the Simons Institute regularly captures photos and video of activity around the Institute for use in videos, publications, and promotional materials. 

Register Now