Lynx: A Programmatic SAT Solver for the RNA-Folding Problem
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.
KeywordsBoolean Formula Baseline Approach Callback Function Pseudoknotted Structure Presburger Arithmetic
Unable to display preview. Download preview PDF.
- 1.Pseudobase RNA sequence, Most widely used database for research on RNA sequences with Psuedoknots. website, http://pseudobaseplusplus.utep.edu/
- 2.SMTLIB website, http://combination.cs.uiowa.edu/smtlib/
- 3.Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press (February 2009)Google Scholar
- 9.Een, N., Sorensson, N.: An extensible SAT-solver. In: Proc. Sixth International Conference on Theory and Applications of Satisfiability Testing, pp. 78–92 (May 2003)Google Scholar
- 14.Lyngsø, R.B., Pedersen, C.N.S.: Pseudoknots in RNA secondary structures. In: Proc. Computational Molecular Biology, RECOMB 2000, pp. 201–209. ACM (2000)Google Scholar