12 #ifndef CPROVER_SOLVERS_PROP_PROP_MINIMIZE_H
13 #define CPROVER_SOLVERS_PROP_PROP_MINIMIZE_H
68 typedef std::map<weightt, std::vector<objectivet>>
objectivest;
Class that provides messages with a built-in verbosity 'level'.
Computes a satisfying assignment of minimal cost according to a const function using incremental SAT.
prop_minimizet(prop_convt &_prop_conv, message_handlert &message_handler)
void fix_objectives()
Fix objectives that are satisfied.
std::size_t number_satisfied() const
std::size_t _number_objectives
std::size_t _number_satisfied
long long signed int weightt
literalt constraint()
Build constraints that require us to improve on at least one goal, greedily.
std::map< weightt, std::vector< objectivet > > objectivest
void operator()()
Try to cover all objectives.
unsigned iterations() const
void objective(const literalt condition, const weightt weight=1)
Add an objective.
objectivest::reverse_iterator current
objectivet(const literalt _condition)