Skillget

genpark-dpll-sat-solver-cnf-backtracking-skill

mcp
Security Audit
Warn
Health Warn
  • No license — Repository has no license file
  • Description — Repository has a description
  • Active repo — Last push 0 days ago
  • Low visibility — Only 7 GitHub stars
Code Pass
  • Code scan — Scanned 6 files during light audit, no dangerous patterns found
Permissions Pass
  • Permissions — No dangerous permissions requested

No AI report is available for this listing yet.

SUMMARY

Davis-Putnam-Logemann-Loveland (DPLL) Boolean satisfiability solver with unit propagation and pure literal elimination

README.md

DPLL SAT Solver Skill

Complete implementation of the Davis-Putnam-Logemann-Loveland (DPLL) Boolean satisfiability solver.

flowchart TD
    CNF["CNF Clauses Input"] --> UP["Unit Propagation Loop"]
    UP --> Empty{"Empty Clause?"}
    Empty -- Yes --> Backtrack["Backtrack (UNSAT Branch)"]
    Empty -- No --> Pure["Pure Literal Elimination"]
    Pure --> AllSat{"All Clauses Satisfied?"}
    AllSat -- Yes --> SAT["SAT Assignment Returned"]
    AllSat -- No --> Branch["Branching on Variable"]
    Branch --> UP

Features

  • 100% Python Standard Library: Pure recursive backtracking engine.
  • Unit Propagation & Pure Literal: Efficient clause reduction.
  • MCP Server Ready: Direct stdio JSON-RPC 2.0 tool interface.

Reviews (0)

No results found