two_sat
Solves boolean satisfiability problems with two-literal clauses by building an implication graph and checking strongly connected components.
Instructions
Solve a 2-SAT boolean satisfiability problem using implication graph and SCC.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| clauses | Yes | Clauses as [a, b] pairs where positive = true, negative = negated | |
| variable_count | Yes | Number of boolean variables (1-based) |