Abstract
Explaining the causes of infeasibility of Boolean formulas has many practical applications in electronic design automation and formal verification of hardware. Furthermore, a minimum explanation of infeasibility that excludes all irrelevant information is generally of interest. A smallest-cardinality unsatisfiable subset called a minimum unsatisfiable core can provide a succinct explanation of infeasibility and is valuable for applications. However, little attention has been concentrated on extraction of minimum unsatisfiable core. In this paper, the relationship between maximal satisfiability and minimum unsatisfiability is presented and proved, then an efficient ant colony algorithm is proposed to derive an exact or nearly exact minimum unsatisfiable core based on the relationship. Finally, experimental results on practical benchmarks compared with the best known approach are reported, and the results show that the ant colony algorithm strongly outperforms the best previous algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
