In this paper, we propose a new method to encode Constraint Satisfaction Problems (CSP)
and Constraint Optimization Problems (COP) with integer linear constraints into Boolean …

There is no silver bullet for software verification: Different techniques have different
strengths. Thus, it is imperative to combine the strengths of verification tools via …

This paper gives some details on the implementation of sugar constraint solver submitted to
the Second International CSP Solver Competition. The sugar solver solves a finite linear …

Parallelizing modern SAT solvers for clusters such as Beowulf is an important challenge
both in terms of performance scalability and stability. This paper describes a SAT Solver c …

We propose a propositional logic based approach to solve MultiObjective Discrete
Optimization Problems (MODOPs). In our approach, there exists a one-to-one …

In this paper, we propose a method to encode Constraint Satisfaction Problems (CSP) and
Constraint Optimization Problems (COP) with integer linear constraints into Boolean …

This work studies how grid and cloud computing can be applied to efficiently solving
propositional satisfiability problem (SAT) instances. Propositional logic provides a …

We propose a satisfiability testing (SAT) based exact approach for solving the
twodimensional strip packing problem (2SPP). In this problem, we are given a set of …

This paper gives the system description of a SAT-based CSP solver Sugar submitted to the
Third International CSP Solver Competition. The Sugar solver solves a finite linear CSP and …

This paper tries to solve open Job-Shop Scheduling Problems (JSSP) by translating them
into Boolean Satisfiability Testing Problems (SAT). The encoding method is essentially the …