Integration of supercubing and learning in a SAT solver

Learning is an essential pruning technique in modern SAT solvers, but it exploits a relatively small amount of information that can be deduced from the conflicts. Recently a new pruning technique called supercubing was proposed by Goldberg et al. (2002). Supercubing can exploit functional symmetries...

Full description

Saved in:
Bibliographic Details
Main Authors: Babic, D., Hu, A.J.
Format: Conference Proceeding
Language:English
Subjects:
Automatic test pattern generation
Boolean functions
Computer science
Councils
Electronic design automation and methodology
Field programmable gate arrays
Memory management
NP-complete problem
Routing
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Learning is an essential pruning technique in modern SAT solvers, but it exploits a relatively small amount of information that can be deduced from the conflicts. Recently a new pruning technique called supercubing was proposed by Goldberg et al. (2002). Supercubing can exploit functional symmetries that are abundant in industrial SAT instances. We point out the significant difficulties of integrating supercubing with learning and propose solutions. Our experimental solver is the first supercubing-based solver with performance comparable to leading edge solvers.
ISSN:2153-6961
2153-697X
DOI:10.1109/ASPDAC.2005.1466203