Exact Model Counting of Query Expressions

DOI10.1145/2984632zbMath1474.68076arXiv1312.4125OpenAlexW2586666171MaRDI QIDQ5012574

Dan Suciu, Jerry Li, Sudeepa Roy, P. W. Beame

Publication date: 25 November 2021

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.4125

zbMATH Keywords

lower boundsmodel countingread-once branching programsknowledge compilationFBDDprobabilistic databasesDNNF

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (3)

An epistemic approach to model uncertainty in data-graphs ⋮ A compositional approach to probabilistic knowledge compilation ⋮ Connecting knowledge compilation classes and width parameters

This page was built for publication: Exact Model Counting of Query Expressions