{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:18:25Z","timestamp":1740122305005,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,6,16]],"date-time":"2022-06-16T00:00:00Z","timestamp":1655337600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,16]],"date-time":"2022-06-16T00:00:00Z","timestamp":1655337600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100007601","name":"Horizon 2020","doi-asserted-by":"publisher","award":["857306"],"award-info":[{"award-number":["857306"]}],"id":[{"id":"10.13039\/501100007601","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","award":["UIDB\/00297- \/2020 (CMA), PTDC\/MAT-PUR\/31174\/2017, UIDB\/04621\/2020 and UIDP\/04621\/2020"],"award-info":[{"award-number":["UIDB\/00297- \/2020 (CMA), PTDC\/MAT-PUR\/31174\/2017, UIDB\/04621\/2020 and UIDP\/04621\/2020"]}]},{"name":"Ministry of Education, Youth and Sports within the dedicated program ERC CZ","award":["POSTMAN no. LL1902"],"award-info":[{"award-number":["POSTMAN no. LL1902"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10601-022-09336-x","type":"journal-article","created":{"date-parts":[[2022,6,16]],"date-time":"2022-06-16T08:02:52Z","timestamp":1655366572000},"page":"360-379","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Boosting isomorphic model filtering with invariants"],"prefix":"10.1007","volume":"27","author":[{"given":"Jo\u00e3o","family":"Ara\u00fajo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2067-0568","authenticated-orcid":false,"given":"Choiwah","family":"Chow","sequence":"additional","affiliation":[]},{"given":"Mikol\u00e1\u0161","family":"Janota","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,16]]},"reference":[{"issue":"2","key":"9336_CR1","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10994-009-5103-0","volume":"75","author":"D Aloise","year":"2009","unstructured":"Aloise, D., Deshpande, A., Hansen, P., & Popat, P. (2009). Np-hardness of euclidean sum-of-squares clustering. Machine Learning, 75(2), 245\u2013248. https:\/\/doi.org\/10.1007\/s10994-009-5103-0.","journal-title":"Machine Learning"},{"doi-asserted-by":"publisher","unstructured":"Ara\u00fajo, 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\u20134:9). Dagstuhl: Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik.","key":"9336_CR2","DOI":"10.4230\/LIPIcs.CP.2021.4"},{"unstructured":"Ara\u00fajo, J., Matos, D., & Ramires, J. Axiomatic library finder (database). https:\/\/axiomaticlibraryfinder.pythonanywhere.com.","key":"9336_CR3"},{"issue":"3","key":"9336_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10817-006-9040-3","volume":"36","author":"G Audemard","year":"2006","unstructured":"Audemard, G., Benhamou, B., & Henocque, L. (2006). Predicting and detecting symmetries in FOL finite model search. Journal of Automated Reasoning, 36(3), 177\u2013212. https:\/\/doi.org\/10.1007\/s10817-006-9040-3.","journal-title":"Journal of Automated Reasoning"},{"doi-asserted-by":"publisher","unstructured":"Audemard, G., & Henocque, L. (2001). The eXtended least number heuristic. In R. Gor\u00e9, 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\u2013442). Berlin: Springer.","key":"9336_CR5","DOI":"10.1007\/3-540-45744-5\/_35"},{"doi-asserted-by":"publisher","unstructured":"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\u2013494). Berlin: Springer.","key":"9336_CR6","DOI":"10.1007\/3-540-45349-0\/_36"},{"issue":"1-2","key":"9336_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.3233\/FI-1999-391202","volume":"39","author":"B Benhamou","year":"1999","unstructured":"Benhamou, B., & Henocque, L. (1999). A hybrid method for finite model search in equational theories. Fundam Informaticae, 39(1-2), 21\u201338. https:\/\/doi.org\/10.3233\/FI-1999-391202.","journal-title":"Fundam Informaticae"},{"issue":"2","key":"9336_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.entcs.2005.01.003","volume":"125","author":"T Boy de la Tour","year":"2005","unstructured":"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\u2013113. 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).","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"9336_CR9","volume-title":"A course in universal algebra. Graduate texts in mathematics, Vol. 78","author":"S Burris","year":"1981","unstructured":"Burris, S., & Sankappanavar, H. P. (1981). A course in universal algebra. Graduate texts in mathematics Vol. 78. New York: Springer."},{"unstructured":"Claessen, K., & S\u00f6rensson, N. (2003). New techniques that improve MACE-style finite model finding. In Proceedings of the CADE-19 workshop: model computation - principles, algorithms, applications.","key":"9336_CR10"},{"unstructured":"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\u2013159). San Francisco: Morgan Kaufmann.","key":"9336_CR11"},{"key":"9336_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0731-3","volume-title":"Permutation groups","author":"JD Dixon","year":"1996","unstructured":"Dixon, J. D., & Mortimer, B. (1996). Permutation groups. New York: Springer."},{"doi-asserted-by":"publisher","unstructured":"Elhamdadi, M., Macquarrie, J., & Restrepo, R. (2012). Automorphism groups of quandles. J. Algebra Appl 11(1). https:\/\/doi.org\/10.1142\/S0219498812500089.","key":"9336_CR13","DOI":"10.1142\/S0219498812500089"},{"unstructured":"The GAP Group: GAP \u2013 Groups, Algorithms, and Programming, Version 4.11.1 (2021). https:\/\/www.gap-system.org.","key":"9336_CR14"},{"unstructured":"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\u2013102). Amsterdam: IOS Press.","key":"9336_CR15"},{"unstructured":"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\u2013437). Menlo Park: AAAI Press \/ The MIT Press.","key":"9336_CR16"},{"doi-asserted-by":"publisher","unstructured":"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\u2013470). Manchester: EasyChair.","key":"9336_CR17","DOI":"10.29007\/w42s"},{"doi-asserted-by":"crossref","unstructured":"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\u2013331). Berlin: Springer.","key":"9336_CR18","DOI":"10.1007\/11814771_29"},{"unstructured":"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\u2013221).","key":"9336_CR19"},{"key":"9336_CR20","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s00233-019-10054-9","volume":"99","author":"ME Malandro","year":"2019","unstructured":"Malandro, M. E. (2019). Enumeration of finite inverse semigroups. Semigroup Forum, 99, 679\u2013723.","journal-title":"Semigroup Forum"},{"key":"9336_CR21","volume-title":"Model theory: an introduction","author":"D Marker","year":"2002","unstructured":"Marker, D. (2002). Model theory: an introduction. New York: Springer."},{"doi-asserted-by":"crossref","unstructured":"McCune, W. (2003). Mace4 reference manual and guide (Technical Memorandum No. 264), 20. https:\/\/www.cs.unm.edu\/mccune\/prover9\/mace4.pdf.","key":"9336_CR22","DOI":"10.2172\/822574"},{"issue":"2","key":"9336_CR23","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1006\/jagm.1997.0898","volume":"26","author":"BD McKay","year":"1998","unstructured":"McKay, B.D. (1998). Isomorph-free exhaustive generation. Journal of Algorithms, 26(2), 306\u2013324. https:\/\/doi.org\/10.1006\/jagm.1997.0898, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0196677497908981.","journal-title":"Journal of Algorithms"},{"doi-asserted-by":"publisher","unstructured":"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\u2013535). New York: ACM.","key":"9336_CR24","DOI":"10.1145\/378239.379017"},{"unstructured":"Nagy, G., & Vojt\u011bchovsk\u00fd, P. (2018). LOOPS, computing with quasigroups and loops in GAP, Version 3.4.1. https:\/\/gap-packages.github.io\/loops\/. Refereed GAP package.","key":"9336_CR25"},{"key":"9336_CR26","volume-title":"Combinatorial optimization: algorithms and complexity","author":"CH Papadimitriou","year":"1982","unstructured":"Papadimitriou, C. H., & Steiglitz, K. (1982). Combinatorial optimization: algorithms and complexity. Upper Saddle: Prentice-Hall."},{"doi-asserted-by":"publisher","unstructured":"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\u201321). Switzerland: Springer.","key":"9336_CR27","DOI":"10.1007\/978-3-030-29007-8\/_1"},{"unstructured":"Sloane, N.J.A., & Inc., T.O.F. (2020). The on-line encyclopedia of integer sequences. http:\/\/oeis.org\/?language=english.","key":"9336_CR28"},{"key":"9336_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00244457","volume":"17","author":"J Zhang","year":"1996","unstructured":"Zhang, J. (1996). Constructing finite algebras with FALCON. Journal of Automated Reasoning, 17, 1\u201322. https:\/\/doi.org\/10.1007\/BF00247667.","journal-title":"Journal of Automated Reasoning"},{"unstructured":"Zhang, J., & Zhang, H. (1995). SEM: a system for enumerating models. In IJCAI. http:\/\/ijcai.org\/Proceedings\/95-1\/Papers\/039.pdf (pp. 298\u2013303).","key":"9336_CR30"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-022-09336-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10601-022-09336-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-022-09336-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T12:18:39Z","timestamp":1659961119000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10601-022-09336-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,16]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["9336"],"URL":"https:\/\/doi.org\/10.1007\/s10601-022-09336-x","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2022,6,16]]},"assertion":[{"value":"16 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}