You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
11 lines
574 B
11 lines
574 B
\item \lect
|
|
We have not yet discussed DPLL(T)? Kick this question?
|
|
We want to decide whether or not a formula in $\mathcal{T}_{E}$ is satisfiable in the theory. To do so, we will transform $\phi_E$ into an equisatisfiable propositional formula $\phi_{prop}$ and then use a SAT solver on $\phi_{prop}$ to get the answer we seek. The name of this method is ...?
|
|
|
|
\begin{itemize}
|
|
\item[$\square$] DPLL(T)
|
|
\item[$\square$] Lazy Encoding
|
|
\item[$\square$] Eager Encoding
|
|
\item[$\square$] Tseitin's Encoding
|
|
\item[$\square$] Ackermann's Reduction
|
|
\end{itemize}
|