diff options
Diffstat (limited to 'src/theory/uf/symmetry_breaker.h')
| -rw-r--r-- | src/theory/uf/symmetry_breaker.h | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/theory/uf/symmetry_breaker.h b/src/theory/uf/symmetry_breaker.h index ddbd50cbb..2b7b10209 100644 --- a/src/theory/uf/symmetry_breaker.h +++ b/src/theory/uf/symmetry_breaker.h @@ -14,8 +14,8 @@ ** \brief Implementation of algorithm suggested by Deharbe, Fontaine, ** Merz, and Paleo, "Exploiting symmetry in SMT problems," CADE 2011 ** - ** Implementation of algorithm suggested by Deharbe, Fontaine, - ** Merz, and Paleo, "Exploiting symmetry in SMT problems," CADE 2011. + ** Implementation of algorithm suggested by Deharbe, Fontaine, Merz, + ** and Paleo, "Exploiting symmetry in SMT problems," CADE 2011. ** ** From the paper: ** @@ -24,7 +24,7 @@ ** foreach \f$ {c_0, ..., c_n} \in P \f$ do ** if \f$ invariant\_by\_permutations(\phi, {c_0, ..., c_n}) \f$ then ** T := \f$ select\_terms(\phi, {c_0, ..., c_n}) \f$ - ** cts := \f$ \empty \f$ + ** cts := \f$ \emptyset \f$ ** while T != \f$ \empty \wedge |cts| <= n \f$ do ** \f$ t := select\_most\_promising\_term(T, \phi) \f$ ** \f$ T := T \setminus {t} \f$ |