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.
5 lines
366 B
5 lines
366 B
The translations used in the eager approach for $\mathcal{T}_{EUF}$ are:
|
|
\begin{enumerate}
|
|
\item Ackermann Reduction: to remove all function instances, resulting in an equisatisfiable formula in $\mathcal{T}_{E}$.
|
|
\item Graph-Based Reduction: to remove all equality instances, resulting in an equisatisfiable formula in propositional logic.
|
|
\end{enumerate}
|