A Python (re-)implementation of some known knowledge compilers

Program for converting formulas of the first-order predicate calculus into a conjunctive normal form.

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.

Generating decision making algorithms by evolutionary / genetic algorithm

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

Solves problems that are in conjunctive normal form (CNF)

A k-satisfiability solver based on Knuth dancing-links X algorithm.

Structured BVA CNF rewriter

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.

Convert Proposition Trees to Conjunctive Normal Form (CNF) or Disjunctive Normal Form (DNF)