A simple theorem prover made for a university programming assignment

Yet Another Sat solvER

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

Implementation of the resolution rule for Propo- sitional Logic in PROLOG.

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.

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.