Results 1 -
2 of
2
Incremental Compilation-to-SAT Procedures
- In: Seventh International Conference on Theory and Applications of Satisfiability Testing
, 2004
"... Abstract. We focus on incremental compilation-to-SAT procedures (iCTS), a promising way to push the standard CTS approaches beyond their limits. We propose the first comprehensive framework that encompasses all the aspects of an incremental decision procedure, from the encoding to the incremental so ..."
Abstract
-
Cited by 9 (3 self)
- Add to MetaCart
(Show Context)
Abstract. We focus on incremental compilation-to-SAT procedures (iCTS), a promising way to push the standard CTS approaches beyond their limits. We propose the first comprehensive framework that encompasses all the aspects of an incremental decision procedure, from the encoding to the incremental solver. We apply our guidelines to a real-world CTS approach (Bounded Model Checking) and show how to modify both the generation mechanism of a real BMC tool (NuSMV) and the solving engine of a public-domain SAT solver (SIM). Related approaches and experimental results are discussed as well. 1
On the Arity of Propositional Connectives
"... We present a simple and semantics-preserving transformation over propositional in-stances which features surprising consequences both on the syntactic structure of the pro-cessed instances and on the performance of state-of-the-art solvers. The instances we con-sider come from a bounded model checki ..."
Abstract
- Add to MetaCart
(Show Context)
We present a simple and semantics-preserving transformation over propositional in-stances which features surprising consequences both on the syntactic structure of the pro-cessed instances and on the performance of state-of-the-art solvers. The instances we con-sider come from a bounded model checking engine applied to real-world problems. The transformation we apply aims at substituting ennary connectives for binary ones whenever possible. Several experimental results are presented and discussed. 1
