Abstract
In recent years, the approach of satisfiability modulo theories (SMT) has been very successful in solving many constraint satisfaction problems. In a typical SMT solver, the base constraints are expressed as a set of propositional clauses, where each Boolean variable is an abstraction of an atomic formula of first-order logic and the interpretation of the formula is constrained by a background theory. A widely studied theory is the linear pseudo-Boolean logic. Following this approach, we present an experiment of a SMT solver where the background theory can be specified in propositional logic and implemented by a procedure. We chose such a procedural background theory because we found no better ways to attack a previously open problem in combinatorial design, i.e., the existence of diagonally ordered magic squares of all orders.
Similar content being viewed by others
References
Abe, G.: Unsolved problems on magic squares. Discrete Math. 127, 3–13 (1994)
Ahmed, M.: Algebraic combinatorics of magic squares. Ph.D. Dissertation, University of California, Davis (2004)
Barrett, C., de Moura, L., Stump, A.: SMT-COMP: satisfiability modulo theories competition. In: Computer Aided Verification, Lecture Notes in Computer Science, vol. 3576, pp. 20–23 (2005)
Barrett, C., Tinelli, C.: CVC3. In: Damm, W., Hermanns, H. (eds.) Proceedings of the 19th International Conference on Computer Aided Verification, vol. 4590 of LNCS, pp. 298–302 (Berlin, July 3–7). Springer, Berlin (2007)
Barrett, C., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability Modulo Theories, vol. 185 of Frontiers in Artificial Intelligence and Applications, Chapter 26. IOS Press, pp. 825–885 (2009)
Barrett, C., Stump, A., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB). www.SMT-LIB.org (2010)
Bayless, S., Val, C.G., Ball, T., Hoos, H.H., Hu, A.J.: Efficient modular SAT solving for IC3. In: FMCAD, pp. 149–156 (2013)
Chen, K., Li, W., Pan, F.: A family of pandiagonal bimagic squares based on orthogonal arrays. J. Comb. Des. 19, 427–438 (2011)
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Commun. Assoc. Comput. Mach. 7, 394–397 (1962)
De Moura, L.: Bjorner, N. Z3: an efficient SMT solver. In: Proceedings of the Theory and Practice of Software, in 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’08/ETAPS’08), pp. 337–340. Springer, Berlin
Een, N., Sorensson, N.: Translating pseudo-boolean constraints into SAT. J. Satisf. Boolean Model. Comput. 2(3–4), 1–25 (2006)
Gomes, C.P., Kautz, H., Sabharwal, A., Selman, B.: Satisfiability Solvers, vol. 185 of Frontiers in Artificial Intelligence and Applications, Chapter 2. IOS Press, pp. 89–134 (2009)
Gomes, C., Sellmann, M.: Streamlined constraint reasoning. Lect. Notes Comput. Sci. 3258, 274–289 (2004)
Kudrle, J.M., Menard, S.B.: Magic squares. In: Colbourn, C.J., Dinitz, J.H. (eds.) The CRC Handbook of Combinatorial Designs, 2nd edn, pp. 524–528. Chapman and Hall/CRC, Boca Raton (2006)
Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver, 39th Design Automation Conference (DAC 2001), Las Vegas, ACM, pp. 530–535 (2001)
Nam, G.-J., Sakallah, K.A., Rutenbar, R.: A new FPGA detailed routing approach via search-based Boolean satisfiability. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 21(6), 674–684 (2002)
Stump, A., Barrett, C.W., Dill, D.L., Levitt, J.R.: A decision procedure for an extensional theory of arrays. In: Proceedings of LICS 01, IEEE, pp. 29–37 (2001)
Moskewicz, M., Madigan, C., Malik, S.: Method and system for efficient implementation of boolean satisfiability, US 7418369 B2. http://www.google.com/patents/US7418369 (2008)
Nieuwenhuis, R., Oliveras, A., Tinelli, C., Solving, S.A.T., Modulo Theories, S.A.T.: From an abstract Davis–Putnam–Logemann–Loveland procedure to DPLL(T). J. ACM 56(6), 937–977 (2006)
Zhang, H.: SATO: an efficient propositional prover. In: Proceedings of International Conference on Automated Deduction (CADE-97), Lecture Notes in Artificial Intelligence, vol. 1104, pp. 308–312. Springer (1997)
Zhang, H.: Combinatorial Designs by SAT Solvers, Chapter 17, vol. 185 of Frontiers in Artificial Intelligence and Applications, IOS Press, pp. 533–568 (2009)
Zhang, H., Stickel, M.: An efficient algorithm for unit propagation. In: Kautz, S. (eds.) Proceedings of the Fourth International Symposium on Artificial Intelligence and Mathematics, pp. 166–179. Ft. Lauderdale, Florida (1996)
Zhang, Y., Chen, J., Wu, D., Zhang, H.: The existence and application of strongly idempotent self-orthogonal row Latin magic arrays. Acta Math. Appl. Sin. to appear
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to the memory of Mark E. Stickel, friend and colleague.
Appendix: SISORLMA(n) for \(n\in \{5 - 13, 15, 19, 23\}\)
Appendix: SISORLMA(n) for \(n\in \{5 - 13, 15, 19, 23\}\)
Rights and permissions
About this article
Cite this article
Zhang, H. An Experiment with Satisfiability Modulo SAT. J Autom Reasoning 56, 143–154 (2016). https://doi.org/10.1007/s10817-015-9354-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10817-015-9354-0