Efficient SAT solving beyond supercubes

SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently, Goldberg et al introduced supercubing, a different approach to search-space pruning, based on a theory that unifies man...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings 2005 : Design Automation Conference : Anaheim Convention Center, Anaheim, CA, June 13-17, 2005 pp. 744 - 749
Main Authors:	Babić, Domagoj, Bingham, Jesse, Hu, Alan J.
Format:	Conference Proceeding
Language:	English
Published:	New York, NY, USA ACM 13.06.2005
Series:	ACM Conferences
Subjects:	Applied computing > Arts and humanities > Architecture (buildings) > Computer-aided design Applied computing > Physical sciences and engineering > Engineering > Computer-aided design Computing methodologies > Artificial intelligence > Search methodologies Computing methodologies > Artificial intelligence > Search methodologies > Discrete space search Computing methodologies > Artificial intelligence > Search methodologies > Game tree search learning formal verification search space pruning SAT
ISBN:	1595930582, 9781595930583
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!