This repository for implementations of Artificial intelligence algorithms
-
Updated
Jan 16, 2018 - Python
This repository for implementations of Artificial intelligence algorithms
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.
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."