In this Ocaml exercise, we give a boolean function in the form of a truth table and we obtain two propositions of propositional logic equivalent to this function, one in Conjunctive Normal Form (CNF) and another in Disjunctive Normal Form (DNF). Computacional logic project.
In this Ocaml exercise, we give a boolean function in the form of a truth table and we obtain two propositions of propositional logic equivalent to this function, one in Conjunctive Normal Form (CNF) and another in Disjunctive Normal Form (DNF). Computacional logic project.