1. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);CW Barrett,2006
2. Barrett, C., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability Modulo Theories, chapter 26, pp. 825–885. IOS Press, Amsterdam (2009)
3. Berman, L.: The complexity of logical theories. Theor. Comput. Sci. 11, 71 (1980)
4. Bozzano, M., Bruttomesso, R., Cimatti, A., Junttila, T.A., van Rossum, P., Schulz, S., Sebastiani, R.: Mathsat: tight integration of sat and mathematical decision procedures. J. Autom. Reasoning 35(1–3), 265–293 (2005)
5. Bradley, A., Manna, Z.: The Calculus of Computation: Decision Procedures with Applications to Verification. Springer, Heidelberg (2010)