Accelerating Boolean Satisfiability (SAT) solving by common subclause elimination
| Autor: | Jeriah Jn Charles-Blount, Yuanlin Zhang, Forrest Sheng Bao, Chris E. Gutierrez, Yaowei Yan |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Linguistics and Language
Theoretical computer science Speedup Heuristic Computer science 0102 computer and information sciences 02 engineering and technology 01 natural sciences Language and Linguistics #SAT 010201 computation theory & mathematics Artificial Intelligence 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Overall performance Common subexpression elimination Hardware_ARITHMETICANDLOGICSTRUCTURES Timeout Boolean satisfiability problem |
| Zdroj: | Artificial Intelligence Review. 49:439-453 |
| ISSN: | 1573-7462 0269-2821 |
| DOI: | 10.1007/s10462-016-9530-6 |
| Popis: | Boolean Satisfiability (SAT) is an important problem in many domains. Modern SAT solvers have been widely used in important industrial applications including automated planning and verification. To solve more problems in real applications, new techniques are needed to speed up SAT solving. Inspired by the success of common subexpression elimination in programming languages and other related areas, we study the impact of common subclause elimination (CSE) on SAT solving. Intensive experiments on many SAT solvers and benchmarks with 48-h timeout show that CSE can consistently improve SAT solving. Up to 5% more SAT13 instances can be solved after CSE. LZW-based CSE shows the best overall performance, particularly in the category of application benchmarks. A potential use of this result is that one may consider the heuristic of applying CSE to boost SAT solver performance on real life applications. Because of many possible ways to improve the benefit of CSE, we hope future research can unleash the full potential of CSE in SAT solving. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink