Satisfiability and constraint satisfaction

Variants of SAT and CSP: 3SAT and the SAT-to-3SAT reduction, bounded-occurrence, monotone, not-all-equal and 1-in-3 SAT, MAX-SAT, MAX-2SAT, MIN-ONES, circuit SAT, binary CSP and betweenness.

• 1-in-3 SAT
• 3-SAT with bounded occurrences
• 3-satisfiability
• Betweenness
• Binary constraint satisfaction
• Circuit satisfiability
• Maximum 2-satisfiability
• Maximum satisfiability
• Minimum 2-satisfiability
• Minimum-ones 3-SAT
• Monotone 3-SAT
• Not-all-equal 3-SAT

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.