A simple automated theorem prover written in Haskell
-
Updated
Apr 24, 2024 - Haskell
A simple automated theorem prover written in Haskell
Yet Another Sat solvER
Artificial Intelligence- First Order Logic and Prolog
Decide the given statement is True or False depending on the given knowledge base, restricted to "For All" Statements. The Algorithm converts the given knowledge base into Resolution tree, and using the proof of restitution, we decide if the given statement is true or false.
Резолюционный прувер для логики первого порядка
Modeled the proof systems of Analytic-Tableaux, First-Order-Resolution, ROBDD etc. in Ocaml to efficiently solve the SAT problem
Demonstration of BDD-based SAT solver that generates checkable proofs of unsatisfiability. Details provided in paper: R. E. Bryant and M. J. H. Heule, "Generating Extended Resolution Proofs in a BDD-based SAT Solver," TACAS 2021
Refutation Prover for FOL using First-Order Resolution
Prove or disprove the given query based on the knowledge base
resolution refutation is method of finding whether the given antecedent implies the consequent or not, it could also be used to check validity of the expressions.
Proves the Sentences (LOGIC Formulae) given in Clausal Form
A library crate for resolving logical clauses in conjuctive normal form
Add a description, image, and links to the resolution-proof topic page so that developers can more easily learn about it.
To associate your repository with the resolution-proof topic, visit your repo's landing page and select "manage topics."