Constrained counting is a fundamental problem in artificial intelligence, with applications in probabilistic reasoning, inexact computing, and statistical physics. In today’s episode, we will learn about research at Rice which studies how graph decompositions and tensor network contraction can be used to solve constrained counting problems. Jeff Dudek is a Rice Ph.D. student working in the field of machine learning with Professor Moshe Vardi.  For more information, please visit CS. Rice.edu