Evaluates a boolean logic expression given a variable assignment map. Operators: &&, ||, !, ^ (XOR), => (IMPLIES), <=> (IFF).

Generates a complete truth table for a boolean logic expression and analyzes whether it is a Tautology, Contradiction, or Satisfiable.

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

Evaluates deterministic JSON Logic rules against a context dataset. Supports boolean, comparisons, math, conditionals, and array rules.

Evaluates a matrix of decision rules against input context. Checks table for completeness and determinism.

Formally analyzes a Finite State Machine (FSM) for determinism, unreachable states, and deadlock states.

Checks whether a target state can be reached from the initial state in a state machine, returning the shortest path execution sequence.

Simulates a sequence of inputs step-by-step through a state machine deterministically.