A scalable algorithm for minimal unsatisfiable core extraction

Nachum Dershowitz*, Ziyad Hanna, Alexander Nadel

*Corresponding author for this work

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

Abstract

We propose a new algorithm for minimal unsatisfiable core extraction, based on a deeper exploration of resolution-refutation properties. We provide experimental results on formal verification benchmarks confirming that our algorithm finds smaller cores than suboptimal algorithms; and that it runs faster than those algorithms that guarantee minimality of the core. (A more complete version of this paper may be found at arXiv.org/pdf/cs.L0/0605085.)

Original languageEnglish
Title of host publicationTheory and Applications of Satisfiability Testing, SAT 2006 - 9th International Conference, Proceedings
PublisherSpringer Verlag
Pages36-41
Number of pages6
ISBN (Print)3540372067, 9783540372066
DOIs
StatePublished - 2006
Event9th International Conference on Theory and Applications of Satisfiability Testing, SAT 2006 - Seattle, WA, United States
Duration: 12 Aug 200615 Aug 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4121 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Conference on Theory and Applications of Satisfiability Testing, SAT 2006
Country/TerritoryUnited States
CitySeattle, WA
Period12/08/0615/08/06

Fingerprint

Dive into the research topics of 'A scalable algorithm for minimal unsatisfiable core extraction'. Together they form a unique fingerprint.

Cite this