9 citations · 10 across the 5 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2024
OPTDTALS: Approximate Logic Synthesis via Optimal Decision Trees Approach
Hao Hu, Shaowei Cai
The growing interest in Explainable Artificial Intelligence (XAI) motivates promising studies of computing optimal Interpretable Machine Learning models, especially decision trees.…
cs.AI2023★ 1 cited
Incremental Satisfiability Modulo Theory for Verification of Deep Neural Networks
Pengfei Yang, Zhiming Chi, Zongxin Liu +4
Constraint solving is an elementary way for verification of deep neural networks (DNN). In the domain of AI safety, a DNN might be modified in its structure and parameters for its…