Skip to main content
Glama

mcp-solver

MIT License
133
  • Linux
  • Apple
test.md303 B
Given a propositional logic formula φ in Conjunctive Normal Form (CNF): φ = (x₁ ∨ x₂) ∧ (¬x₁ ∨ x₃) ∧ (¬x₂ ∨ ¬x₃) Determine whether there exists a truth assignment to variables {x₁, x₂, x₃} such that φ evaluates to TRUE, and if such an assignment exists, identify it.

MCP directory API

We provide all the information about MCP servers via our MCP API.

curl -X GET 'https://glama.ai/api/mcp/v1/servers/szeider/mcp-solver'

If you have feedback or need assistance with the MCP directory API, please join our Discord server