Probabilistic Circuits and Logic

Program

Logic and Algorithms in Database Theory and AI

Location

Calvin Lab Auditorium

Date

Monday, Oct. 16 – Friday, Oct. 20, 2023

Back to calendar

9 – 9:25 a.m.

Coffee and Check-in

9:25 – 9:30 a.m.

Opening Remarks

9:30 – 10:10 a.m.

Compiling FO Sentences to Circuits: Upper Bounds and Lower Bounds on the Size of the Circuit

Dan Suciu (University of Washington)

10:10 – 10:50 a.m.

The Intensional-Extensional Problem in Probabilistic Databases

Mikael Monet (INRIA)

10:50 – 11:20 a.m.

Break

11:20 a.m. – 12 p.m.

Model Counting Meets Distinct Estimation

Kuldeep Meel (University of Toronto)

12 – 2 p.m.

Lunch (on your own)

2 – 2:40 p.m.

Credal Models for Uncertainty and Logic Treatment

Cassio de Campos (TU Eindhoven)

2:40 – 3 p.m.

Break

3 – 4 p.m.

Reception

9 – 9:30 a.m.

Coffee and Check-in

9:30 – 10:10 a.m.

AND/OR Search Spaces for Anytime Probabilistic Reasoning

Rina Dechter (UC Irvine)

10:10 – 10:50 a.m.

First-Order Model Counting and Sampling

Ondrej Kuzelka (Prague University)

10:50 – 11:20 a.m.

Break

11:20 a.m. – 12 p.m.

Combined Approximations for Probabilistic Query Evaluation: An Intensional Approach

Timothy Van Bremen (National University of Singapore)

12 – 2 p.m.

Lunch (on your own)

2 – 2:40 p.m.

Tractable Bounding of Counterfactual Queries by Knowledge Compilation

Alessandro Antonucci (IDSIA)

2:40 – 3:20 p.m.

Lower Bounds for Tractable Arithmetic Circuits

Alexis de Colnet (TU Wien)

3:20 – 3:50 p.m.

Break

3:50 – 5 p.m.

Discussion

9 – 9:30 a.m.

Coffee and Check-in

9:30 – 10:10 a.m.

Efficient Enumeration Algorithms via Circuits

Antoine Amarilli (Telecom Paris)

10:10 – 10:50 a.m.

Leveraging tree automata approximation results for efficient sampling and counting in Boolean circuits

Marcelo Arenas (PUC Chile and RelationalAI)

10:50 – 11:20 a.m.

Break

11:20 a.m. – 12 p.m.

Factorized Databases

Ahmet Kara (University of Zurich)

12 – 2 p.m.

Lunch (on your own)

2 – 2:40 p.m.

Direct Access for Conjunctive Queries with Negation

Florent Capelli (Université d'Artois, CNRS, CRIL)

2:40 – 3:20 p.m.

Solving Marginal MAP Exactly by Probabilistic Circuit Transformations

YooJung Choi (Arizona State University)

3:20 – 3:50 p.m.

Break

3:50 – 5 p.m.

Discussion

9 – 9:30 a.m.

Coffee and Check-in

9:30 – 10:10 a.m.

Decision Diagrams for Efficient Inference and Optimization in Expressive Discrete+Continuous Domains

Scott Sanner (University of Toronto)

10:10 – 10:50 a.m.

The Rise of Tractable Circuits: From Cryptography to Continuous Generative Models

Robert Peharz (TU Graz)

10:50 – 11:20 a.m.

Break

11:20 a.m. – 12 p.m.

Subtractive Mixture Models: Representation and Learning

Antonio Vergari (University of Edinburgh)

12 – 2 p.m.

Lunch (on your own)

2 – 2:40 p.m.

An Approximate Skolem Function Counter

Brendan Juba (Washington University in St. Louis)

2:40 – 3:20 p.m.

Weighted Model Integration

Zhe Zeng (UCLA)

3:20 – 3:50 p.m.

Break

3:50 – 5 p.m.

Discussion

9 – 9:30 a.m.

Coffee and Check-in

9:30 – 10:10 a.m.

Marginal Determinism in Structured Decomposable Circuits

Benjie Wang (University of Oxford)

10:10 – 10:50 a.m.

On Finding Modes of Gaussian Sum-Product Networks

Denis Maua (University of Sao Paulo)

10:50 – 11:20 a.m.

Break

11:20 a.m. – 12 p.m.

Tractable Control for Autoregressive Language Generation

Honghua Zhang (UCLA)

12 – 2 p.m.

Lunch (on your own)

2 – 2:40 p.m.

Approximating the TV Distance Between Two Product Distributions

Weiming Feng (University of Edinburgh)

2:40 – 3:20 p.m.

Utilizing Structure in Combinatorial Solving and Reasoning

Markus Hecher (MIT)

3:20 – 3:50 p.m.

Discussion

3:50 – 4 p.m.

Closing