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.
12 lines
798 B
12 lines
798 B
The main idea of eager encoding is that the input formula is translated into a
|
|
propositional formula with all relevant theory-specific information encoded into
|
|
the formula.
|
|
|
|
\begin{enumerate}[label=(\Roman*)]
|
|
\item Replace any unique $\Theory$-atom in the original formula $\varphi$ with a fresh propositional variable to get a propositional formula $\hat{\varphi}$. \label{item:varphi_prop}
|
|
\item Generate a propositional formula $\varphi_{cons}$ that constrains the values of the introduced
|
|
propositional variables to preserve the information of the theory. \label{item:varphi_cons}
|
|
|
|
\item Invoke a SAT solver on the propositional formula $\varphi_{prop} \coloneqq \hat{\varphi} \land \varphi_{cons}$
|
|
that corresponds to an equisatisfiable propositional formula to $\varphi$.
|
|
\end{enumerate}
|