Hints revealed

Jonathan Kalechstain, Vadim Ryvchin, Nachum Dershowitz

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

Abstract

We propose a notion of hints, clauses that are not necessarily consistent with the input formula. The goal of adding hints is to speed up the SAT solving process. For this purpose, we provide an efficient general mechanism for hint addition and removal. When a hint is determined to be inconsistent, a hint-based partial resolution-graph of an unsatisfiable core is used to reduce the search space. The suggested mechanism is used to boost performance by adding generated hints to the input formula. We describe two specific hint-suggestion methods, one of which increases performance by 30% on satisfiable SAT’13 competition instances and solves 9 instances not solved by the baseline solver.

Original languageEnglish
Title of host publicationTheory and Applications of Satisfiability Testing – SAT 2015 - 18th International Conference, Proceedings
EditorsMarijn Heule, Sean Weaver
PublisherSpringer Verlag
Pages71-87
Number of pages17
ISBN (Print)9783319243177
DOIs
StatePublished - 2015
Event18th International Conference on Theory and Applications of Satisfiability Testing, SAT 2015 - Austin, United States
Duration: 24 Sep 201527 Sep 2015

Publication series

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

Conference

Conference18th International Conference on Theory and Applications of Satisfiability Testing, SAT 2015
Country/TerritoryUnited States
CityAustin
Period24/09/1527/09/15

Fingerprint

Dive into the research topics of 'Hints revealed'. Together they form a unique fingerprint.

Cite this