Skillget

genpark-dpll-sat-solver-boolean-satisfiability-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 8 GitHub stars
Code Pass
  • Code scan — Scanned 4 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

GenPark AI Agent Skill - DPLL (Davis-Putnam-Logemann-Loveland) Boolean satisfiability solver with unit clause propagation and pure literal elimination for agent policy verification.

README.md

GenPark DPLL SAT Solver Boolean Satisfiability Skill

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

Explore more at GenPark and the GenPark MCP Catalog.

graph TD
    A[CNF Formula Clauses] --> B[Unit Propagation]
    B --> C[Pure Literal Elimination]
    C --> D{Base Case Check}
    D -->|Empty Clause Found| E[Backtrack: UNSAT branch]
    D -->|All Clauses Satisfied| F[Return SAT with Model Assignment]
    D -->|Undetermined| G[Branch Variable x = True / False]
    G --> B

Features

  • Complete pure Python DPLL CNF solver.
  • Fast unit clause reduction and pure literal simplification.
  • Zero external dependencies.

Reviews (0)

No results found