–
Coffee and Check-in
–
Opening Remarks
–
Compiling FO Sentences to Circuits: Upper Bounds and Lower Bounds on the Size of the Circuit
Dan Suciu (University of Washington)
–
The Intensional-Extensional Problem in Probabilistic Databases
Mikael Monet (INRIA)
–
Break
–
Model Counting Meets Distinct Estimation
Kuldeep Meel (University of Toronto)
–
Lunch (on your own)
–
Credal Models for Uncertainty and Logic Treatment
Cassio de Campos (TU Eindhoven)
–
Break
–
Reception
–
Coffee and Check-in
–
AND/OR Search Spaces for Anytime Probabilistic Reasoning
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
–
Efficient Enumeration Algorithms via Circuits
Antoine Amarilli (Telecom Paris)
–
Leveraging tree automata approximation results for efficient sampling and counting in Boolean circuits
Marcelo Arenas (PUC Chile and RelationalAI)
–
Break
–
Factorized Databases
Ahmet Kara (University of Zurich)
–
Lunch (on your own)
–
Direct Access for Conjunctive Queries with Negation
Florent Capelli (Université d'Artois, CNRS, CRIL)
–
Solving Marginal MAP Exactly by Probabilistic Circuit Transformations
YooJung Choi (Arizona State University)
–
Break
–
Discussion
–
Coffee and Check-in
–
Decision Diagrams for Efficient Inference and Optimization in Expressive Discrete+Continuous Domains
Scott Sanner (University of Toronto)
–
The Rise of Tractable Circuits: From Cryptography to Continuous Generative Models
Robert Peharz (TU Graz)
–
Break
–
Subtractive Mixture Models: Representation and Learning
Antonio Vergari (University of Edinburgh)
–
Lunch (on your own)
–
An Approximate Skolem Function Counter
Brendan Juba (Washington University in St. Louis)
–
Weighted Model Integration
Zhe Zeng (UCLA)
–
Break
–
Discussion
–
Coffee and Check-in
–
Marginal Determinism in Structured Decomposable Circuits
Benjie Wang (University of Oxford)
–
On Finding Modes of Gaussian Sum-Product Networks
Denis Maua (University of Sao Paulo)
–
Break
–
Tractable Control for Autoregressive Language Generation
Honghua Zhang (UCLA)
–
Lunch (on your own)
–
Approximating the TV Distance Between Two Product Distributions
Weiming Feng (University of Edinburgh)
–
Utilizing Structure in Combinatorial Solving and Reasoning
Markus Hecher (MIT)
–
Discussion
–
Closing