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.
9 lines
599 B
9 lines
599 B
\item \self In the following list tick all statements that conform to the lazy encoding approach
|
|
for the implementation of SMT solver.
|
|
|
|
\begin{itemize}
|
|
\item[$\square$] Lazy encoding is based on the interaction between a SAT solver and a so-called theory solver.
|
|
\item[$\square$] Lazy encoding involves translating the original formula to an equisatisfiable Boolean formula in a single step.
|
|
\item[$\square$] Lazy encoding is based on the direct encoding of axioms.
|
|
\item[$\square$] Lazy encoding starts with no constraints at all and adds constraints only when needed.
|
|
\end{itemize}
|