An Inference Engine based on Propositional Calculus written in Common Lisp
-
Updated
Jan 13, 2025 - Common Lisp
An Inference Engine based on Propositional Calculus written in Common Lisp
An exhaustive condensed detachment formal proof generator for Hilbert systems in proof theory.
Python package that provides an interface to work with classical propositional and first-order logic, based on my solutions to the textbook Mathematical Logic Through Python by Nisan and Gonczarowski
My contributions to Metamath's mmsolitaire project.
An interpreter for sentential logic (propositional calculus) written in Python. Includes a resolution-based automated theorem prover.
In this bachelor thesis, I developed a toolkit for automated reasoning and interpolation with ordered resolution.
An Expression Oriented Language with non-strict semantics based on Propositional Calculus and compatible with WFF
A propositional calculus expert system.
Propositional theorem prover - resolution with pure literal elimination and subsumption elimination, implemented in ISO Prolog. Educational software.
Pequeno projeto de uma "calculadora" de lógica proposicional.
🧮 validation methods of propositional logic
Console application for calculating propositional calculus formulas. Can create truth tables, show steps to result, check for validity, etc. Programmed in C#.
🧠💡 Web app to calculate everything related to propositional-calculus. Made for myself to pass TZI subject at Mendel University, but shared for everyone else for free to use it as well!
A utility for proofs in the propositional calculus. Currently finished - a way of parsing (most) valid strings in the PC as Sentences which can be added to proofs. Working on a mechanism for machine proof.
Expert System for Propositional Logic calculus
A Python library providing basic functionalities for manipulating propositional logic
The PLL(Propositional Logic Library) is a library which offers a lexical and syntactic analyzer for propositional predicate analysis
Programas para construção de tabelas-verdade com duas e três variáveis em Fortran.
An implementation of the Shunting Yard algorithm to parse and evaluate Propositional Calculus expressions
Add a description, image, and links to the propositional-calculus topic page so that developers can more easily learn about it.
To associate your repository with the propositional-calculus topic, visit your repo's landing page and select "manage topics."