-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- In slides: move the SSAT-encoding table back to related work
- Loading branch information
nianze
committed
May 24, 2021
1 parent
42308cc
commit 57f6812
Showing
7 changed files
with
355 additions
and
270 deletions.
There are no files selected for viewing
Large diffs are not rendered by default.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,30 +1,55 @@ | ||
\begin{frame} | ||
\frametitle{Model Counting} | ||
\begin{itemize} | ||
\item Exact: find the precise count | ||
\pause | ||
\begin{itemize} | ||
\item \cachet~\cite{Sang2004,Sang2005ModelCounting}: DPLL search plus subformula caching | ||
\pause | ||
\item \texttt{c2d}~\cite{Darwiche2001,Darwiche2002dDNNF}: CNF-to-d-DNNF compilation | ||
\pause | ||
\end{itemize} | ||
\item Approximate: bounds with guarantee | ||
\pause | ||
\begin{itemize} | ||
\item \approxmc~\cite{Chakraborty2013,Chakraborty2016}: $\Pr[(1+\epsilon)^{-1}\#\pf \leq A \leq (1+\epsilon)\#\pf] \geq 1-\delta$ | ||
\pause | ||
\end{itemize} | ||
\item Variants: expressible by SSAT | ||
\pause | ||
\begin{itemize} | ||
\item Weighted model counting~\cite{Sang2005BayesianInference,Chavira2008} | ||
\pause | ||
\item Projected model counting~\cite{Aziz2015} | ||
\pause | ||
\item Maximum model counting~\cite{Fremont2017} | ||
\pause | ||
\end{itemize} | ||
\item Model Counting Competition~\cite{MC-COMP2020} | ||
\end{itemize} | ||
\frametitle{Model Counting} | ||
\begin{itemize} | ||
\item Exact: find the precise count | ||
\pause | ||
\begin{itemize} | ||
\item \cachet~\cite{Sang2004,Sang2005ModelCounting}: DPLL search plus subformula caching | ||
\pause | ||
\item \texttt{c2d}~\cite{Darwiche2001,Darwiche2002dDNNF}: CNF-to-d-DNNF compilation | ||
\pause | ||
\item \dpmc~\cite{Dudek2020}: project-join tree and arithmetic decision diagrams | ||
\pause | ||
\end{itemize} | ||
\item Approximate: bounds with guarantee | ||
\pause | ||
\begin{itemize} | ||
\item \approxmc~\cite{Chakraborty2013,Chakraborty2016}: $\Pr[(1+\epsilon)^{-1}\#\pf \leq A \leq (1+\epsilon)\#\pf] \geq 1-\delta$ | ||
\pause | ||
\end{itemize} | ||
\item Variants: expressible by SSAT | ||
\pause | ||
\begin{itemize} | ||
\item Weighted model counting~\cite{Sang2005BayesianInference,Chavira2008} | ||
\pause | ||
\item Projected model counting~\cite{Aziz2015} | ||
\pause | ||
\item Maximum model counting~\cite{Fremont2017} | ||
\pause | ||
\item Weighted projected model counting | ||
\pause | ||
\begin{itemize} | ||
\item \procount~\cite{Dudek2021}: ordering of projected and non-projected variables | ||
\pause | ||
\end{itemize} | ||
\end{itemize} | ||
\item Model Counting Competition~\cite{MC-COMP2020} | ||
\end{itemize} | ||
\end{frame} | ||
|
||
\begin{frame} | ||
\frametitle{Express Model-Counting Variants with SSAT} | ||
\begin{table}[t] | ||
\centering | ||
\begin{tabular}{c|c} | ||
Variant & SSAT encoding \\ | ||
\hline | ||
Unweighted & $\random{0.5}x_1,\ldots,\random{0.5}x_n.\pf$ \\ | ||
Weighted & $\random{p_1}x_1,\ldots,\random{p_n}x_n.\pf$ \\ | ||
Projected & $\random{0.5}x_1,\ldots,\random{0.5}x_n,\exists y_1,\ldots,\exists y_m.\pf$ \\ | ||
Maximum & $\exists x_1,\ldots,\exists x_n,\random{0.5}y_1,\ldots,\random{0.5}y_m.\pf$ \\ | ||
Weighted projected & $\random{p_1}x_1,\ldots,\random{p_n}x_n,\exists y_1,\ldots,\exists y_m.\pf$ \\ | ||
Maximum weighted & $\exists x_1,\ldots,\exists x_n,\random{p_1}y_1,\ldots,\random{p_m}y_m.\pf$ \\ | ||
\end{tabular} | ||
\end{table} | ||
\end{frame} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.