Converting formula into CNF using rules. Created at the University as the project within Logic in Computer Science classes in 2016. The purpose of this project was to learn converting formulas into CNF based on Prolog's rules.

This assignment covers key topics in logic, theorem proving, and knowledge representation relevant to Artificial Intelligence.

A set of parsers for DIMACS formats written in Prolog

Sat-Solver is a Prolog program that converts propositional logic formulas into CNF and solves them using the DPLL algorithm. It processes logical expressions and applies unit propagation, clause simplification, and variable branching. The project was mainly built to improve skills in Prolog.

A GNU Prolog programme to convert boolean expressions into CNF.