Posted on January 6, 2018 and last updated on February 3, 2018 by Mistral Contrastin

Logic and Proof Example Sheet I

From the lecture notes

Exam questions


This is bonus question, don’t do it if you don’t feel like it.

Write a program to convert a propositional formula to its BDD representation.

A tree data structure suffices as output, but once you have that it shouldn’t be too difficult to output a file in DOT language, which gives you a nice pictorial representation.