Satisfiability Checking with Difference Constraints
Scott Cotton, Andreas Podelski, Bernd Finkbeiner · 2005
This thesis studies the problem of determining the satisfiability of a Boolean combination of binary difference constraints of the form x-y <= c where x and y are numeric variables and c is a constant. In particular, we present an incremental and model-based interpreter for the theory of difference constraints in the context of a generic Boolean satisfiability checking procedure capable of incorporating interpreters for arbitrary theories. We show how to use the model based approach to efficiently make inferences with the option of complete inference.