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

Yet Another Sat solvER

Prove or disprove the given query based on the knowledge base

Refutation Prover for FOL using First-Order Resolution

Artificial Intelligence- First Order Logic and Prolog

A library crate for resolving logical clauses in conjuctive normal form

Резолюционный прувер для логики первого порядка

A simple automated theorem prover written in Haskell

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

Modeled the proof systems of Analytic-Tableaux, First-Order-Resolution, ROBDD etc. in Ocaml to efficiently solve the SAT problem

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.