Sagaert, César (2023) Finding Boolean formulas on a finite domain PRE - Research Project, ENSTA.

[img]
Preview
PDF
400Kb
[img]
Preview
PDF
44Kb

Abstract

The MCP System is a collection of software packages designed to find Boolean formulae on training databases, and then predict properties on other data, thus linking machine learning and the explainability of Boolean logic. The initial version only works with Boolean values, which leads to a binarisation of the raw data and an exponential explosion in its size. The aim is therefore to convert the system so that it can process values on a finite, ordered domain that is larger than the Boolean domain. To do this, we need to rewrite and adapt a large part of the original source code, in the C++ programming language.

Item Type:Thesis (PRE - Research Project)
Uncontrolled Keywords:Boolean logic, C++, Machine learning, Finite domain, Explainability, Optimisation
Subjects:Information and Communication Sciences and Technologies
ID Code:9663
Deposited By:Cesar Sagaert
Deposited On:29 août 2023 09:24
Dernière modification:29 août 2023 09:24

Repository Staff Only: item control page