Video URL

https://simons.berkeley.edu/talks/tbd-257

The Rise of Approximate Model Counting: Beyond Classical Theory and Practice of SAT

(2021). The Rise of Approximate Model Counting: Beyond Classical Theory and Practice of SAT. The Simons Institute for the Theory of Computing. https://simons.berkeley.edu/talks/tbd-257

The Rise of Approximate Model Counting: Beyond Classical Theory and Practice of SAT. The Simons Institute for the Theory of Computing, Feb. 09, 2021, https://simons.berkeley.edu/talks/tbd-257 

          @misc{ scivideos_17230,
            doi = {},
            url = {https://simons.berkeley.edu/talks/tbd-257},
            author = {},
            keywords = {},
            language = {en},
            title = {The Rise of Approximate Model Counting: Beyond Classical Theory and Practice of SAT},
            publisher = {The Simons Institute for the Theory of Computing},
            year = {2021},
            month = {feb},
            note = {17230 see, \url{https://scivideos.org/Simons-Institute/17230}}
          }
Kuldeep Meel (National University of Singapore)
Source Repository Simons Institute
Subject

Abstract

Approximate Model Counting asks to compute the number of solutions of a formula F within a desired tolerance and confidence. While the earliest algorithmic ideas go back to the seminal work in the 1980's, scalable approximate counters were elusive until recently. In this talk, we will shed light on what makes the state of the art counters such as ApproxMC tick. In particular, we will illustrate how algorithmic frameworks' design needs considerations beyond the classical theory. The practical realization of these frameworks requires one to go beyond the traditional CNF solving.