Invited Talk: Tractable Boolean Circuits: Applications and Compilation Algorithms
Tractable Boolean circuits have been playing an increasingly important role in AI and beyond, being also the basis for tractable probabilistic circuits. This includes (1) providing a systematic approach for tackling problems beyond NP, (2) allowing one to learn from certain combinations of knowledge and data, and (3) reasoning about the behavior of some machine learning systems. In this talk, I will review the basics and applications of tractable Boolean circuits, while also discussing the compilation of Boolean formula into tractable circuits: a critical process which can benefit from additional efforts by the broad computer science community.
Sun 15 Nov Times are displayed in time zone: Central Time (US & Canada) change
|13:05 - 13:45|
I: Adnan DarwicheUCLA
|13:45 - 14:15|
|14:15 - 14:25|