TY - GEN
T1 - SCSat
T2 - 16th International Conference on Theory and Applications of Satisfiability Testing, SAT 2013
AU - Fujita, Hiroshi
AU - Koshimura, Miyuki
AU - Hasegawa, Ryuzo
PY - 2013
Y1 - 2013
N2 - SCSat is a SAT solver aimed at quickly finding a model for hard satisfiable instances using soft constraints. Soft constraints themselves are not necessarily maximally satisfied and may be relaxed if they are too strong to obtain a model. Appropriately given soft constraints can reduce search space drastically without losing many models, thus help find a model faster. In this way, we have succeeded to obtain several rare Ramsey graphs which contribute to raise the known best lower bound for the Ramsey number R(4,8) from 56 to 58.
AB - SCSat is a SAT solver aimed at quickly finding a model for hard satisfiable instances using soft constraints. Soft constraints themselves are not necessarily maximally satisfied and may be relaxed if they are too strong to obtain a model. Appropriately given soft constraints can reduce search space drastically without losing many models, thus help find a model faster. In this way, we have succeeded to obtain several rare Ramsey graphs which contribute to raise the known best lower bound for the Ramsey number R(4,8) from 56 to 58.
UR - http://www.scopus.com/inward/record.url?scp=84879972413&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84879972413&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-39071-5_32
DO - 10.1007/978-3-642-39071-5_32
M3 - Conference contribution
AN - SCOPUS:84879972413
SN - 9783642390708
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 415
EP - 421
BT - Theory and Applications of Satisfiability Testing, SAT 2013 - 16th International Conference, Proceedings
Y2 - 8 July 2013 through 12 July 2013
ER -