An Experimentally Efficient Method for (MSS,CoMSS) Partitioning

The concepts of MSS (Maximal Satisfiable Subset) and CoMSS (also called Minimal Correction Subset) play a key role in many A. I. approaches and techniques. In this paper, a novel algorithm for partitioning a Boolean CNF formula into one MSS and the corresponding CoMSS is introduced. Extensive empirical evaluation shows that it is more robust and more efficient on most instances than currently available techniques.

Authors

• Eric Grégoire
• Jean-Marie Lagniez
• Bertrand Mazure Artois University

Keywords

No keywords are indexed for this paper.