This Project shows an understanding of Propositional Logic, Conjunctive Normal Form, and The Resolution Refutation Method.

Research code to find similarity and local/constructive symmetries of clausal propositions or graph isomophisms

🧠 Classification of pathologies column using propositional logic satisfiability algorithms.

A resolver for propositional logic schemata/well-formed formulas using Quine’s method of truth value analysis.

A Theorem Prover for Propositional Logic

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

COMP305 (Biocomputation) group project at the University of Liverpool. Converts a string of propositional logic to a McCulloch-Pitts network.

OpenPAS consists of a library, a script runtime, and an interactive console that is capable of probabilistic argumentation and propositional logic operations. OpenPAS contains a full implementation of Probabilistic Argumentation Systems (PAS) which is a framework that is a combination of propositional logic and probability theory.

This is the repository for our CSC-490 project at UNCG in the Spring 2021 semester.

Theorem Prover for Propositional Logic using the truth table method for formulas in Conjuntive Normal Form.

Propositional logic compiler

A better sat-solver than my previous String-based sat-solver

Automatically checks whether a given propositional formula is satisfiable.

Supplementing a Bayesian Network with classical and defeasible inference logical statements.

Export conclusions with resolution (resolution) / conclusions with forward chaining for (definite) Horn clauses of propositional logic

Propositional statement validity check or also check statement is true at least once or not.

A simple theorem prover made for a university programming assignment