https://github.com/maxbrheinl/sat-solver

Sat-Solver is a Prolog program that converts propositional logic formulas into CNF and solves them using the DPLL algorithm. It processes logical expressions and applies unit propagation, clause simplification, and variable branching. The project was mainly built to improve skills in Prolog.
https://github.com/maxbrheinl/sat-solver

cnf dpll-algorithm logical-programming prolog sat-solver

Last synced: 1 day ago
JSON representation

Sat-Solver is a Prolog program that converts propositional logic formulas into CNF and solves them using the DPLL algorithm. It processes logical expressions and applies unit propagation, clause simplification, and variable branching. The project was mainly built to improve skills in Prolog.

• Host: GitHub
• URL: https://github.com/maxbrheinl/sat-solver
• Owner: MaxBRheinl
• Created: 2025-02-25T09:07:54.000Z (12 months ago)
• Default Branch: main
• Last Pushed: 2025-02-25T09:11:56.000Z (12 months ago)
• Last Synced: 2025-08-04T12:39:31.643Z (6 months ago)
• Topics: cnf, dpll-algorithm, logical-programming, prolog, sat-solver
• Language: Prolog
• Homepage:
• Size: 4.88 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.txt

Awesome Lists containing this project

README

          
Export the necessary predicates in the sat_solver module.

The tests from the .plt file are loaded in your module automatically by using load_test_files/1.

Run SAT tests:

swipl sat_solver.pl

?- run_tests.

Run single test block:

?- run_tests(cnf).

Run single test:

?- run_tests(cnf:to_cnf1).