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.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"variable_count": "<variable_count>",
"clauses": "<clauses>"
},
"name": "two_sat"
}
}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) |