Compiling Model-Based Diagnosis to Boolean Satisfaction

This paper introduces an encoding of Model Based Diagnosis (MBD) to Boolean Satisfaction (SAT) focusing on minimal cardinality diagnosis. The encoding is based on a combination of sophisticated MBD preprocessing algorithms and SAT compilation techniques which together provide concise CNF formula. Experimental evidence indicates that our approach is superior to all published algorithms for minimal cardinality MBD. In particular, we can determine, for the first time, minimal cardinality diagnoses for the entire standard ISCAS-85 benchmark. Our results open the way to improve the state-ofthe-art on a range of similar MBD problems.

Authors

• Amit Metodi Ben-Gurion University
• Roni Stern Ben-Gurion University of the Negev
• Meir Kalech Ben-Gurion University of the Negev
• Mike Codish Ben-Gurion University

Keywords

No keywords are indexed for this paper.