z3 alternative for Gecode branch() function?
问题 In constraint solver like Gecode , We can control the exploration of search space with help of branching function. for e.g. branch(home , x , INT_VAL_MIN ) This will start exploring the search space from the minimum possible value of variable x in its domain and try to find solution.(There are many such alternatives .) For z3, do we have this kind of flexibility in-built ?? Any alternative possible?? 回答1: SMT solvers usually do not allow for these sorts of "hints" to be given, they act more