Yet Another Sat solvER
-
Updated
Jan 3, 2024 - C
Yet Another Sat solvER
A simple theorem prover made for a university programming assignment
In this bachelor thesis, I developed a toolkit for automated reasoning and interpolation with ordered resolution.
This repository for implementations of Artificial intelligence algorithms
A Propositional Logic Interpreter written in Node.js
Performs normal form conversions of propositional formulas through the use of syntax trees, and provides 3 sat-solver algorithms with verifiable step-by-step output.
Propositional theorem prover - resolution with pure literal elimination and subsumption elimination, implemented in ISO Prolog. Educational software.
Implementation of the resolution rule for Propo- sitional Logic in PROLOG.
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.
A propositional logic prover implemented using resolution refutation.
Add a description, image, and links to the propositional-resolution topic page so that developers can more easily learn about it.
To associate your repository with the propositional-resolution topic, visit your repo's landing page and select "manage topics."