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
Core classes, methods and functions for calculating logical formulas and constructing proofs within the Chop Logic project.
Refutation Prover for FOL using First-Order Resolution
A simple automated theorem prover written in Haskell
Prove or disprove the given query based on the knowledge base
Modeled the proof systems of Analytic-Tableaux, First-Order-Resolution, ROBDD etc. in Ocaml to efficiently solve the SAT problem
Proves the Sentences (LOGIC Formulae) given in Clausal Form
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.
Резолюционный прувер для логики первого порядка
Projects Knowledge Representation and Reasoning (KRR), MSc Artificial Intelligence, Year 1, Semester 1, Faculty of Mathematics and Computer Science, University of Bucharest
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.
A library crate for resolving logical clauses in conjuctive normal form
To associate your repository with the resolution-proof topic, visit your repo's landing page and select "manage topics."