Abstract
The enumeration of finite models is very important to the working discrete mathematician (algebra, graph theory, etc) and hence the search for effective methods to do this task is a critical goal in discrete computational mathematics. However, it is hindered by the possible existence of many isomorphic models, which usually only add noise. Typically, they are filtered out a posteriori, a step that might take a long time just to discard redundant models. This paper proposes a novel approach to split the generated models into mutually non-isomorphic blocks. To do that we use well-designed hand-crafted invariants as well as randomly generated invariants. The blocks are then tackled separately and possibly in parallel. This approach is integrated into Mace4 (the most popular tool among mathematicians) where it shows tremendous speed-ups for a large variety of algebraic structures.
Similar content being viewed by others
Notes
Some preliminary ideas and results have been presented in [2]. This paper adds more invariants including randomly generated invariants and proves their validity. It also reports substantially more experimental results and drills deeper into related work.
We conjecture that the problem is NP-hard; it resembles K-means clustering, which is NP-hard [1].
References
Aloise, D., Deshpande, A., Hansen, P., & Popat, P. (2009). Np-hardness of euclidean sum-of-squares clustering. Machine Learning, 75(2), 245–248. https://doi.org/10.1007/s10994-009-5103-0.
Araújo, J., Chow, C., & Janota, M. (2021). Filtering isomorphic models by invariants. In L.D. Michel (Ed.) 27th International conference on principles and practice of constraint programming (CP 2021), Leibniz international proceedings in informatics (LIPIcs). https://doi.org/10.4230/LIPIcs.CP.2021.4, https://drops.dagstuhl.de/opus/volltexte/2021/15295, (Vol. 210 pp. 4:1–4:9). Dagstuhl: Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Araújo, J., Matos, D., & Ramires, J. Axiomatic library finder (database). https://axiomaticlibraryfinder.pythonanywhere.com.
Audemard, G., Benhamou, B., & Henocque, L. (2006). Predicting and detecting symmetries in FOL finite model search. Journal of Automated Reasoning, 36(3), 177–212. https://doi.org/10.1007/s10817-006-9040-3.
Audemard, G., & Henocque, L. (2001). The eXtended least number heuristic. In R. Goré, A. Leitsch, & T. Nipkow (Eds.) Automated reasoning, first international joint conference, IJCAR 2001, Siena, Italy, June 18-23, 2001, proceedings, lecture notes in computer science. https://doi.org/10.1007/3-540-45744-5/_35, (Vol. 2083 pp. 427–442). Berlin: Springer.
Baptista, L., & Silva, J.P.M. (2000). Using randomization and learning to solve hard real-world instances of satisfiability. In R. Dechter (Ed.) Principles and practice of constraint programming - CP 2000, 6th international conference, Singapore, September 18-21, 2000, proceedings, lecture notes in computer science. https://doi.org/10.1007/3-540-45349-0/_36, (Vol. 1894 pp. 489–494). Berlin: Springer.
Benhamou, B., & Henocque, L. (1999). A hybrid method for finite model search in equational theories. Fundam Informaticae, 39(1-2), 21–38. https://doi.org/10.3233/FI-1999-391202.
Boy de la Tour, T., & Countcham, P. (2005). An isomorph-free SEM-like enumeration of models. Electronic Notes in Theoretical Computer Science, 125(2), 91–113. https://doi.org/10.1016/j.entcs.2005.01.003, https://www.sciencedirect.com/science/article/pii/S1571066105000976. Proceedings of the 5th International Workshop on Strategies in Automated Deduction (Strategies 2004).
Burris, S., & Sankappanavar, H. P. (1981). A course in universal algebra. Graduate texts in mathematics Vol. 78. New York: Springer.
Claessen, K., & Sörensson, N. (2003). New techniques that improve MACE-style finite model finding. In Proceedings of the CADE-19 workshop: model computation - principles, algorithms, applications.
Crawford, J. M., Ginsberg, M. L., Luks, E. M., & Roy, A. (1996). Symmetry-breaking predicates for search problems. In L.C. Aiello, J. Doyle, & S.C. Shapiro (Eds.) Proceedings of the fifth international conference on principles of knowledge representation and reasoning (KR) (pp. 148–159). San Francisco: Morgan Kaufmann.
Dixon, J. D., & Mortimer, B. (1996). Permutation groups. New York: Springer.
Elhamdadi, M., Macquarrie, J., & Restrepo, R. (2012). Automorphism groups of quandles. J. Algebra Appl 11(1). https://doi.org/10.1142/S0219498812500089.
The GAP Group: GAP – Groups, Algorithms, and Programming, Version 4.11.1 (2021). https://www.gap-system.org.
Gent, I.P., Jefferson, C., & Miguel, I. (2006). Minion: a fast scalable constraint solver. In G. Brewka, S. Coradeschi, A. Perini, & P. Traverso (Eds.) ECAI 2006, 17th European conference on artificial intelligence, August 29 - September 1, 2006, Riva del Garda, Italy, including prestigious applications of intelligent systems (PAIS 2006), proceedings, frontiers in artificial intelligence and applications. http://www.booksonline.iospress.nl/Content/View.aspx?piid=1654, (Vol. 141 pp. 98–102). Amsterdam: IOS Press.
Gomes, C.P., Selman, B., & Kautz, H.A. (1998). Boosting combinatorial search through randomization. In J. Mostow C. Rich (Eds.) Proceedings of the fifteenth national conference on artificial intelligence and tenth innovative applications of artificial intelligence conference, AAAI 98, IAAI 98, July 26-30, 1998, Madison, Wisconsin, USA. http://www.aaai.org/Library/AAAI/1998/aaai98-061.php (pp. 431–437). Menlo Park: AAAI Press / The MIT Press.
Janota, M., & Suda, M. (2018). Towards smarter MACE-style model finders. In G. Barthe, G. Sutcliffe, & M. Veanes (Eds.) LPAR-22. 22nd international conference on logic for programming, artificial intelligence and reasoning, EPiC series in computing. https://doi.org/10.29007/w42s, (Vol. 57 pp. 454–470). Manchester: EasyChair.
Jia, X., & Zhang, J. (2006). A powerful technique to eliminate isomorphism in finite model search. In U. Furbach N. Shankar (Eds.) Automated reasoning (pp. 318–331). Berlin: Springer.
Lynce, I., Baptista, L., & Marques-Silva, J. (2002). Complete unrestricted backtracking algorithms for satisfiability. In Proceedings of the international symposium on theory and applications of satisfiability testing (pp. 214–221).
Malandro, M. E. (2019). Enumeration of finite inverse semigroups. Semigroup Forum, 99, 679–723.
Marker, D. (2002). Model theory: an introduction. New York: Springer.
McCune, W. (2003). Mace4 reference manual and guide (Technical Memorandum No. 264), 20. https://www.cs.unm.edu/mccune/prover9/mace4.pdf.
McKay, B.D. (1998). Isomorph-free exhaustive generation. Journal of Algorithms, 26(2), 306–324. https://doi.org/10.1006/jagm.1997.0898, https://www.sciencedirect.com/science/article/pii/S0196677497908981.
Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., & Malik, S. (2001). Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th design automation conference, DAC 2001, Las Vegas, NV, USA, June 18-22, 2001. https://doi.org/10.1145/378239.379017 (pp. 530–535). New York: ACM.
Nagy, G., & Vojtěchovský, P. (2018). LOOPS, computing with quasigroups and loops in GAP, Version 3.4.1. https://gap-packages.github.io/loops/. Refereed GAP package.
Papadimitriou, C. H., & Steiglitz, K. (1982). Combinatorial optimization: algorithms and complexity. Upper Saddle: Prentice-Hall.
Reger, G., Riener, M., & Suda, M. (2019). Symmetry avoidance in MACE-style finite model finding. In A. Herzig A. Popescu (Eds.) Frontiers of combining systems - 12th international symposium, FroCoS 2019, London, UK, September 4-6, 2019, proceedings, lecture notes in computer science. https://doi.org/10.1007/978-3-030-29007-8/_1, (Vol. 11715 pp. 3–21). Switzerland: Springer.
Sloane, N.J.A., & Inc., T.O.F. (2020). The on-line encyclopedia of integer sequences. http://oeis.org/?language=english.
Zhang, J. (1996). Constructing finite algebras with FALCON. Journal of Automated Reasoning, 17, 1–22. https://doi.org/10.1007/BF00247667.
Zhang, J., & Zhang, H. (1995). SEM: a system for enumerating models. In IJCAI. http://ijcai.org/Proceedings/95-1/Papers/039.pdf (pp. 298–303).
Funding
João Araújo: The results were supported by the Fundação para a Ciência e a Tecnologia, through the projects UIDB/00297-/2020 (CMA), PTDC/MAT-PUR/31174/2017, UIDB/04621/2020 and UIDP/04621/2020.
Mikoláš Janota: The results were supported by the Ministry of Education, Youth and Sports within the dedicated program ERC CZ under the project POSTMAN no. LL1902. This scientific article is part of the RICAIP project that has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 857306.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of Interests
The authors declare that they have no conflict of interest.
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Araújo, J., Chow, C. & Janota, M. Boosting isomorphic model filtering with invariants. Constraints 27, 360–379 (2022). https://doi.org/10.1007/s10601-022-09336-x
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10601-022-09336-x