This document discusses logical operations on binary decision diagrams. It introduces conjunction, disjunction, and negation as logical operations and how they are represented in Venn diagrams and binary decision diagrams. Binary decision diagrams provide a graph-based representation similar to a binary tree for modeling logical expressions using conjunction, disjunction, and negation. Examples of applying these logical operations to expressions are also provided.

1. Logical Operations
On BDD
Submitted to:
Prof. Hafiz Md. Hasan Babu
Ashis Kumar Chanda
MS (2014-15), Roll 343
Department of Computer Science and Engineering
University of Dhaka
1 I NAME OF PRESENTER

2.  Logical Operations
 Binary Decision Diagram
11/22/14 2

3. If you have good score AND publications
apply for research assistantship
If you have good score OR voice
apply for teacher assistantship
11/22/14 3

4. In 1880, John Venn proposed an idea that is known
as Venn Diagram
Conjunction
11/22/14 4

5. In 1880, John Venn proposed an idea that is known
as Venn Diagram
Disjunction
11/22/14 5

6. In 1880, John Venn proposed an idea that is known
as Venn Diagram
Negation
11/22/14 6

7.  Conjunction (AND, both must present)
 Disjunction (OR, anyone must present)
 Negation (NOT, reverse status)
11/22/14 7

8.  Binary Decision Diagram
Graph representation similar to a binary
tree
Conjunction Disjunction Negation
11/22/14 8

9.  f = ((A . B) V (B . C))’
11/22/14 9
Solution 

10. Questions?
11/22/14 10

11. http://www2.engr.arizona.edu/~slysecky/courses/
ece474a_f06/public_html/lecture_slides/bdd.pdf
 http://en.wikipedia.org/wiki/Logical_conjunction
http://en.wikipedia.org/wiki/Logical_disjunction
11/22/14 11