Propositional theorem prover using the tableaux method and FOL theorem prover using resolution
-
Updated
Mar 22, 2017 - OCaml
Propositional theorem prover using the tableaux method and FOL theorem prover using resolution
Modeled the proof systems of Analytic-Tableaux, First-Order-Resolution, ROBDD etc. in Ocaml to efficiently solve the SAT problem
Logic for Computer Science course projects
A simple k-SAT problem solver.
Add a description, image, and links to the first-order-logic topic page so that developers can more easily learn about it.
To associate your repository with the first-order-logic topic, visit your repo's landing page and select "manage topics."