68 search results - page 8 / 14 » Resolution Tunnels for Improved SAT Solver Performance |
FORMATS
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. The main novelty of our solver is a tighter integra...
147
click to vote
SAT
2011
Springer
14 years 12 days ago
2011
Springer
Failed literal detection (FL) in SAT is a powerful approach for preprocessing. The basic idea is to assign a variable as assumption. If boolean constraint propagation (BCP) yields ...
ACSD
2007
IEEE
15 years 1 months ago
2007
IEEE
Synthesis of asynchronous circuits from Signal Transition Graphs (STGs) involves resolution of state encoding conflicts by means of refining the STG specification. In this paper, ...
CP
2010
Springer
14 years 8 months ago
2010
Springer
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
DAC
2003
ACM
15 years 10 months ago
2003
ACM
Bounded Model Checking (BMC) based on Boolean Satisfiability (SAT) procedures has recently gained popularity as an alternative to BDD-based model checking techniques for finding b...