Lynx: a programmatic sat solver for the rna-folding. This paper introduces Lynx, an incremental programmatic SAT solver that allows non-expert users to introduce domain-specific code into modern conflict-driven clause-learning (CDCL) SAT solvers, thus enabling users to guide the behavior of the solver. The key idea of Lynx is a callback interface that enables non-expert users to specialize the SAT solver to a class of Boolean instances. The user writes specialized code for a class of Boolean formulas, which is periodically called by Lynx’s search routine in its inner loop through the callback interface. The user-provided code is allowed to examine partial solutions generated by the solver during its search, and to respond by adding CNF clauses back to the solver dynamically and incrementally. Thus, the user-provided code can specialize and influence the solver’s search in a highly targeted fashion. While the power of incremental SAT solvers has been amply demonstrated in the SAT literature and in the context of DPLL(T), it has not been previously made available as a programmatic API that is easy to use for non-expert users. Lynx’s callback interface is a simple yet very effective strategy that addresses this need. We demonstrate the benefits of Lynx through a case-study from computational biology, namely, the RNA secondary structure prediction problem. The constraints that make up this problem fall into two categories: structural constraints, which describe properties of the biological structure of the solution, and energetic constraints, which encode quantitative requirements that the solution must satisfy. We show that by introducing structural constraints on-demand through user provided code we can achieve, in comparison with standard SAT approaches, upto 30x reduction in memory usage and upto 100x reduction in time.
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Zulkoski, Edward; Ganesh, Vijay; Czarnecki, Krzysztof: MathCheck: a math assistant via a combination of computer algebra systems and SAT solvers (2015)
- Soh, Takehide; Le Berre, Daniel; Roussel, Stéphanie; Banbara, Mutsunori; Tamura, Naoyuki: Incremental SAT-based method with native Boolean cardinality handling for the Hamiltonian cycle problem (2014)
- Mihal, Andrew; Teig, Steve: A constraint satisfaction approach for programmable logic detailed placement (2013)
- Ganesh, Vijay; O’Donnell, Charles W.; Soos, Mate; Devadas, Srinivas; Rinard, Martin C.; Solar-Lezama, Armando: Lynx: a programmatic SAT solver for the RNA-folding problem (2012)