Abstract
This paper discusses several techniques to make the look- ahead architecture for satisfiability (Sat) solvers more competitive. Our contribution consists of reduction of the computational costs to perform look-ahead and a cheap integration of both equivalence reasoning and local learning. Most proposed techniques are illustrated with experimental results of their implementation in our solver march_eq.
Original language | Undefined/Unknown |
---|---|
Pages (from-to) | 345-359 |
Number of pages | 15 |
Journal | Lecture Notes in Computer Science |
Volume | 3542 |
DOIs | |
Publication status | Published - 2005 |
Keywords
- academic journal papers
- ZX CWTS JFIS < 1.00