A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Typical random 3-SAT formulae and the satisfiability threshold
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
An adaptive noise mechanism for walkSAT
Eighteenth national conference on Artificial intelligence
The threshold for random k-SAT is 2k (ln 2 - O(k))
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A backbone-search heuristic for efficient solving of hard 3-SAT formulae
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
UBCSAT: an implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Fifty-five solvers in vancouver: the SAT 2004 competition
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
March_eq: implementing additional reasoning into an efficient look-ahead SAT solver
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Phase Transition in the Bandwidth Minimization Problem
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
A stochastic non-CNF SAT solver
PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Speeding-up non-clausal local search for propositional satisfiability with clause learning
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Programming for modular reconfigurable robots
Programming and Computing Software
A framework for the specification of random SAT and QSAT formulas
TAP'12 Proceedings of the 6th international conference on Tests and Proofs
| Hi-index | 0.00 |
We present the results from experiments with a new family of random formulas for the satisfiability problem. Our proposal is a generalisation of the random k-SAT model that introduces non-clausal formulas and exhibits interesting features such as experimentally observed sharp phase transition and the easy-hard-easy pattern. The experimental results provide some insights on how the use of different clausal translations can affect the performance of satisfiability solving algorithms. We also expect our model to provide diverse and challenging benchmarks for developers of SAT procedures for non-clausal formulas.