{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:45:32Z","timestamp":1762101932255,"version":"build-2065373602"},"reference-count":18,"publisher":"Cambridge University Press (CUP)","issue":"5-6","license":[{"start":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T00:00:00Z","timestamp":1476403200000},"content-version":"unspecified","delay-in-days":43,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2016,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Symmetry in combinatorial problems is an extensively studied topic. We continue this research in the context of model expansion problems, with the aim of automating the workflow of detecting and breaking symmetry. We focus on<jats:italic>local domain symmetry<\/jats:italic>, which is induced by permutations of domain elements, and which can be detected on a first-order level. As such, our work is a continuation of the symmetry exploitation techniques of model generation systems, while it differs from more recent symmetry breaking techniques in answer set programming which detect symmetry on ground programs. Our main contributions are sufficient conditions for symmetry of model expansion problems, the identification of<jats:italic>local domain interchangeability<\/jats:italic>, which can often be broken completely, and efficient symmetry detection algorithms for both local domain interchangeability as well as local domain symmetry in general. Our approach is implemented in the model expansion system IDP, and we present experimental results showcasing the strong and weak points of our approach compared to<jats:sc>sbass<\/jats:sc>, a symmetry breaking technique for answer set programming.<\/jats:p>","DOI":"10.1017\/s1471068416000508","type":"journal-article","created":{"date-parts":[[2016,10,15]],"date-time":"2016-10-15T21:28:20Z","timestamp":1476566900000},"page":"636-652","source":"Crossref","is-referenced-by-count":9,"title":["On local domain symmetry for model expansion"],"prefix":"10.1017","volume":"16","author":[{"given":"JO","family":"DEVRIENDT","sequence":"first","affiliation":[]},{"given":"BART","family":"BOGAERTS","sequence":"additional","affiliation":[]},{"given":"MAURICE","family":"BRUYNOOGHE","sequence":"additional","affiliation":[]},{"given":"MARC","family":"DENECKER","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2016,10,14]]},"reference":[{"key":"S1471068416000508_ref16","first-page":"632","volume-title":"TACAS","author":"Torlak","year":"2007"},{"key":"S1471068416000508_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.10.018"},{"key":"S1471068416000508_ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2006.75"},{"key":"S1471068416000508_ref8","unstructured":"Devriendt J. , Bogaerts B. , Bruynooghe M. and Denecker M. 2016. On local domain symmetry for model expansion. Available at http:\/\/arxiv.org\/abs\/1608.02688."},{"key":"S1471068416000508_ref3","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/3-540-45620-1_19","volume-title":"Automated Deduction - CADE-18, 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002, Proceedings","author":"Audemard","year":"2002"},{"key":"S1471068416000508_ref5","unstructured":"De Cat B. , Bogaerts B. , Bruynooghe M. , Janssens G. and Denecker M. 2016. Predicate logic as a modelling language: The IDP system. CoRR abs\/1401.6312v2."},{"key":"S1471068416000508_ref18","unstructured":"Zhang J. and Zhang H. 1995. Sem: A system for enumerating models. In Department of Philosophy University of Wisconsin-Madison Mathematics and Computer Science. 298\u2013303."},{"key":"S1471068416000508_ref4","unstructured":"Claessen K. and S\u00f6rensson N. 2003. New Techniques that Improve MACE-style Model Finding. In Workshop on Model Computation (MODEL)."},{"key":"S1471068416000508_ref9","first-page":"177","article-title":"Symmetry-breaking answer set solving.","volume":"24","author":"Drescher","year":"2011","journal-title":"IA Communications"},{"key":"S1471068416000508_ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1342991.1342998"},{"key":"S1471068416000508_ref1","unstructured":"Aloul F. , Ramani A. , Markov I. and Sakallah K. 2002. Solving difficult SAT instances in the presence of symmetry. In Design Automation Conference, 2002. Proceedings. 39th. 731\u2013736."},{"key":"S1471068416000508_ref17","unstructured":"Walsh T. 2012. Symmetry breaking constraints: Recent results. CoRR abs\/1204.3348."},{"key":"S1471068416000508_ref11","unstructured":"Gebser M. , Kaminski R. , Kaufmann B. and Schaub T. 2014. Clingo = ASP + control: Preliminary report. In Technical Communications of the Thirtieth International Conference on Logic Programming (ICLP'14), M. Leuschel and T. Schrijvers , Eds. Vol. 14(4-5). Online Supplement."},{"key":"S1471068416000508_ref13","first-page":"113","volume-title":"SAT","author":"Katebi","year":"2010"},{"key":"S1471068416000508_ref7","unstructured":"Devriendt J. , Bogaerts B. and Bruynooghe M. 2014. BreakIDGlucose: On the importance of row symmetry in SAT. In Proceedings of the Fourth International Workshop on the Cross-Fertilization Between CSP and SAT (CSPSAT)."},{"key":"S1471068416000508_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S1574-6526(06)80014-3"},{"volume-title":"A Mathematical Introduction To Logic","year":"2001","author":"Enderton","key":"S1471068416000508_ref10"},{"key":"S1471068416000508_ref14","first-page":"289","volume-title":"Symmetry and Satisfiability","author":"Sakallah","year":"2009"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068416000508","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T17:04:44Z","timestamp":1568480684000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068416000508\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9]]},"references-count":18,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["S1471068416000508"],"URL":"https:\/\/doi.org\/10.1017\/s1471068416000508","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2016,9]]}}}