Skip to main content
Glama
SamSoupSauce

deterministic-logic

by SamSoupSauce

solve_sat

Determine if a boolean expression is satisfiable by converting it to CNF and using DPLL to find a satisfying assignment or prove UNSAT.

Instructions

DPLL SAT solver for boolean satisfiability. Converts expression to Conjunctive Normal Form (CNF) and finds satisfying assignments or proves UNSAT.

Input Schema

TableJSON Schema
NameRequiredDescriptionDefault
expressionYesThe boolean expression to solve (e.g., "(A || B) && (!A || B) && (!B)")
Behavior4/5

Does the description disclose side effects, auth requirements, rate limits, or destructive behavior?

With no annotations, the description carries the full burden. It discloses key behaviors: expression is converted to CNF, and results are satisfying assignments or UNSAT. However, it does not mention error handling or performance considerations for large expressions.

Agents need to know what a tool does to the world before calling it. Descriptions should go beyond structured annotations to explain consequences.

Conciseness5/5

Is the description appropriately sized, front-loaded, and free of redundancy?

The description is a single, dense sentence with no wasted words. It front-loads the core purpose and efficiently covers input, process, and output.

Shorter descriptions cost fewer tokens and are easier for agents to parse. Every sentence should earn its place.

Completeness5/5

Given the tool's complexity, does the description cover enough for an agent to succeed on first attempt?

Given the tool has only one parameter, no output schema, and no nested objects, the description is complete. It covers input, processing steps, and possible outputs.

Complex tools with many parameters or behaviors need more documentation. Simple tools need less. This dimension scales expectations accordingly.

Parameters4/5

Does the description clarify parameter syntax, constraints, interactions, or defaults beyond what the schema provides?

Schema coverage is 100% for the single parameter. The description provides an example syntax for the expression, adding meaning beyond the schema's type and description.

Input schemas describe structure but not intent. Descriptions should explain non-obvious parameter relationships and valid value ranges.

Purpose5/5

Does the description clearly state what the tool does and how it differs from similar tools?

The description clearly states it is a DPLL SAT solver for boolean satisfiability, specifying the process (conversion to CNF) and output (satisfying assignments or UNSAT). It distinguishes from sibling tools like evaluate_boolean or generate_truth_table through its specific purpose.

Agents choose between tools based on descriptions. A clear purpose with a specific verb and resource helps agents select the right tool.

Usage Guidelines3/5

Does the description explain when to use this tool, when not to, or what alternatives exist?

The description does not explicitly state when to use this tool versus alternatives, nor does it provide exclusions or guidance. Usage is implied through the tool name and purpose, but lacks explicit context for an agent.

Agents often have multiple tools that could apply. Explicit usage guidance like "use X instead of Y when Z" prevents misuse.

Install Server

Other Tools

Latest Blog Posts

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/SamSoupSauce/deterministic-logic'

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