Symmetries for Cube-And-Conquer in Finite Model Finding
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F23%3A00372128" target="_blank" >RIV/68407700:21730/23:00372128 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.4230/LIPIcs.CP.2023.8" target="_blank" >https://doi.org/10.4230/LIPIcs.CP.2023.8</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4230/LIPIcs.CP.2023.8" target="_blank" >10.4230/LIPIcs.CP.2023.8</a>
Alternative languages
Result language
angličtina
Original language name
Symmetries for Cube-And-Conquer in Finite Model Finding
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/LL1902" target="_blank" >LL1902: Powering SMT Solvers by Machine Learning</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
29th International Conference on Principles and Practice of Constraint Programming (CP 2023)
ISBN
978-3-95977-300-3
ISSN
1868-8969
e-ISSN
1868-8969
Number of pages
18
Pages from-to
—
Publisher name
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Place of publication
Dagstuhl
Event location
Toronto
Event date
Aug 27, 2023
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—