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

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

University algorithm-oriented project that accurately detects complex networks of influential mafia families represented as vertices and edges of rare graphs. The algorithms are being reduced to the Satisfiability Problem using a boolean formula that will be evaluated by an SAT Solver, deciding whether the initial clause has been satisfied or not.

A Certifier algorithm to check a particular solution to the NP-Complete 3-Sat problem

Création des tables de vérité des expressions logiques sous forme conjonctive