59 citations · 68 across the 20 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.LG2020★ 1 cited
Understanding Boolean Function Learnability on Deep Neural Networks: PAC Learning Meets Neurosymbolic Models
Marcio Nicolau, Anderson R. Tavares, Zhiwei Zhang +4
Computational learning theory states that many classes of boolean formulas are learnable in polynomial time. This paper addresses the understudied subject of how, in practice, such…
cs.FL2020★ 4 cited
On the Power of Automata Minimization in Reactive Synthesis
Shufang Zhu, Lucas M. Tabajara, Geguang Pu +1
Temporal logic is often used to describe temporal properties in AI applications. The most popular language for doing so is Linear Temporal Logic (LTL). Recently, LTL on finite trac…