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

Visit talk page

The Intensional-Extensional Problem in Probabilistic Databases

Visit talk page

Model Counting Meets Distinct Estimation

Visit talk page

Credal Models for Uncertainty and Logic Treatment

Visit talk page

AND/OR Search Spaces for Anytime Probabilistic Reasoning

Visit talk page

First-Order Model Counting and Sampling

Visit talk page

Combined Approximations for Probabilistic Query Evaluation: An Intensional Approach

Visit talk page

Tractable Bounding of Counterfactual Queries by Knowledge Compilation

Visit talk page

Lower Bounds for Tractable Arithmetic Circuits

Visit talk page

Efficient Enumeration Algorithms via Circuits

Visit talk page