|
carl
25.04
Computer ARithmetic Library
|
Typedefs | |
| template<typename Poly > | |
| using | TseitinConstraints = std::vector< Formula< Poly > > |
| template<typename Poly > | |
| using | ConstraintBounds = FastMap< Poly, std::map< typename Poly::NumberType, std::pair< Relation, Formula< Poly > >> > |
Functions | |
| template<typename Poly > | |
| std::vector< Formula< Poly > > | construct_iff (const Formula< Poly > &lhs, const std::vector< Formula< Poly >> &rhs_and) |
| Constructs the equivalent of (iff lhs (and *rhs_and))) The result is the list (=> lhs (and *rhs_and)) (=> rhs !lhs) (for each rhs in rhs_and) More... | |
| template<typename Poly > | |
| Formula< Poly > | to_cnf_or (const Formula< Poly > &f, bool keep_constraints, bool simplify_combinations, bool tseitin_equivalence, TseitinConstraints< Poly > &tseitin) |
| Converts an OR to cnf. More... | |
| using carl::formula_to_cnf::ConstraintBounds = typedef FastMap<Poly, std::map<typename Poly::NumberType, std::pair<Relation,Formula<Poly> >> > |
| using carl::formula_to_cnf::TseitinConstraints = typedef std::vector<Formula<Poly> > |
| Formula<Poly> carl::formula_to_cnf::to_cnf_or | ( | const Formula< Poly > & | f, |
| bool | keep_constraints, | ||
| bool | simplify_combinations, | ||
| bool | tseitin_equivalence, | ||
| TseitinConstraints< Poly > & | tseitin | ||
| ) |