Yet Another Sat solvER

A simple theorem prover made for a university programming assignment

This repository for implementations of Artificial intelligence algorithms

In this bachelor thesis, I developed a toolkit for automated reasoning and interpolation with ordered resolution.

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.

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.

Propositional theorem prover - resolution with pure literal elimination and subsumption elimination, implemented in ISO Prolog. Educational software.