In this paper we present GRASPER, a graph constraint solver, based on set constraints. We specify GRASPER’s constraints and we make use of our framework to model a problem in the...
We offer a transition system representing a high-level but detailed architecture for SMT solvers that combine a propositional SAT engine with solvers for multiple disjoint theorie...
In previous work, we have presented a novel global feasibility solver for the large system of quadratic constraints that arise as subproblems in the solving of hard hybrid problems...
Nitin Lamba, Mark Dietz, Daniel P. Johnson, Mark S...
We present a new approach to integrating Constraint Processing (CP) techniques into Answer Set Programming (ASP). Based on an alternative semantic approach, we develop an algorithm...
Efficient constraint propagation is crucial to any constraint solver. We show that watched literals, already a great success in the satisfiability community, can be used to provide...