Lecture by Stefan Mengel (CNRS): A Biased Introduction to Decomposable Negation Normal Forms
Decomposable Negation Normal Forms (DNNF) are a class of Boolean circuits first introduced by Darwiche in 2001 in the context of artificial intelligence. Since then they have found applications as a flexible framework for encoding Boolean functions in other areas of computer science like theoretical computer science and database theory. In this talk, I will introduce DNNF, discuss some uses and sketch how one can show bounds on their size.
Time & Location
Nov 30, 2020 | 02:15 PM