Login / Signup
Describing and Measuring the Complexity of SAT encodings for Constraint Programs.
Alexander Bau
Johannes Waldmann
Published in:
WLP/WFLP (2014)
Keyphrases
</>
linear arithmetic constraints
sat encodings
upper bound
decision problems
special case
sat solvers
genetic programming
dynamic environments
combinatorial problems
linear constraints