Lucile Dierckx

Learning from Logical Constraints with Lower- and Upper-Bound Arithmetic Circuits

An important class of neuro-symbolic (NeSy) methods relies on knowledge compilation (KC) techniques to transform logical constraints into a differentiable exact arithmetic circuit (AC) that represents all models of a logical formula. However, given the complexity of KC, compiling such exact circuits