A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems

We propose a novel approach for the development, analysis, and verification of reductions between NP-complete problems. This method uses the URSA system, a SAT-based constraint solver and incorporates features that distinguish it from existing related systems.