BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: Decomposable Negation Normal Forms (DNNF) are a class of Boole
 an circuits first introduced by Darwiche in 2001 in the context of artifici
 al intelligence. Since then they have found applications as a flexible fram
 ework for encoding Boolean functions in other areas of computer science lik
 e theoretical computer science and database theory. In this talk\, I will i
 ntroduce DNNF\, discuss some uses and sketch how one can show bounds on the
 ir size. 
DTSTAMP:20201123T181700
DTSTART:20201130T141500
CLASS:PUBLIC
LOCATION:online
SEQUENCE:0
SUMMARY:Stefan Mengel (CNRS): A Biased Introduction to Decomposable Negatio
 n Normal Forms
UID:107738855@www.facetsofcomplexity.de
URL:http://www.facetsofcomplexity.de/monday/20201130-L-Mengel.html
END:VEVENT
END:VCALENDAR