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