License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CP.2023.8
URN: urn:nbn:de:0030-drops-190455
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/19045/
Araújo, João ;
Chow, Choiwah ;
Janota, Mikoláš
Symmetries for Cube-And-Conquer in Finite Model Finding
Abstract
The cube-and-conquer paradigm enables massive parallelization of SAT solvers, which has proven to be crucial in solving highly combinatorial problems. In this paper, we apply the paradigm in the context of finite model finding, where we show that isomorphic cubes can be discarded since they lead to isomorphic models. However, we are faced with the complication that a well-known technique, the Least Number Heuristic (LNH), already exists in finite model finders to effectively prune (some) isomorphic models from the search. Therefore, it needs to be shown that isomorphic cubes still can be discarded when the LNH is used. The presented ideas are incorporated into the finite model finder Mace4, where we demonstrate significant improvements in model enumeration.
BibTeX - Entry
@InProceedings{araujo_et_al:LIPIcs.CP.2023.8,
author = {Ara\'{u}jo, Jo\~{a}o and Chow, Choiwah and Janota, Mikol\'{a}\v{s}},
title = {{Symmetries for Cube-And-Conquer in Finite Model Finding}},
booktitle = {29th International Conference on Principles and Practice of Constraint Programming (CP 2023)},
pages = {8:1--8:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-300-3},
ISSN = {1868-8969},
year = {2023},
volume = {280},
editor = {Yap, Roland H. C.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/19045},
URN = {urn:nbn:de:0030-drops-190455},
doi = {10.4230/LIPIcs.CP.2023.8},
annote = {Keywords: finite model enumeration, cube-and-conquer, symmetry-breaking, parallel algorithm, least number heuristic}
}
