Efficient MUS extraction with resolution

Alexander Nadel, Vadim Ryvchin, Ofer Strichman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We report advances in state-of-the-art algorithms for the problem of Minimal Unsatisfiable Subformula (MUS) extraction. First, we demonstrate how to apply techniques used in the past to speed up resolution-based Group MUS extraction to plain MUS extraction. Second, we show that model rotation, presented in the context of assumption-based MUS extraction, can also be used with resolution-based MUS extraction. Third, we introduce an improvement to rotation, called eager rotation. Finally, we propose a new technique for speeding-up resolution-based MUS extraction, called path strengthening. We integrated the above techniques into the publicly available resolution-based MUS extractor HaifaMUC, which, as a result, now outperforms leading MUS extractors.

Original languageEnglish
Title of host publication2013 Formal Methods in Computer-Aided Design, FMCAD 2013
Pages197-200
Number of pages4
DOIs
StatePublished - 2013
Event13th International Conference on Formal Methods in Computer-Aided Design, FMCAD 2013 - Portland, OR, United States
Duration: 20 Oct 201323 Oct 2013

Publication series

Name2013 Formal Methods in Computer-Aided Design, FMCAD 2013

Conference

Conference13th International Conference on Formal Methods in Computer-Aided Design, FMCAD 2013
Country/TerritoryUnited States
CityPortland, OR
Period20/10/1323/10/13

All Science Journal Classification (ASJC) codes

  • Computer Graphics and Computer-Aided Design
  • Logic

Fingerprint

Dive into the research topics of 'Efficient MUS extraction with resolution'. Together they form a unique fingerprint.

Cite this