<div class="csl-bib-body">
<div class="csl-entry">Szeider, S. (2023, April 18). <i>Isomorph-Free Generation of Combinatorial Objects with SAT Modulo Symmetries</i> [Presentation]. Extended Reunion: Satisfiability 2023, United States of America (the).</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/190994
-
dc.description.abstract
SAT modulo Symmetries (SMS) is a framework for the exhaustive isomorph-free generation of combinatorial objects with a prescribed property. SMS relies on the tight integration of a CDCL SAT solver with a custom dynamic symmetry-breaking algorithm that iteratively refines an ordered partition of the generated object's elements. SMS supports the generation of DRAT proofs and thus provides an additional layer of confidence in the obtained results. This talk will discuss the basic concepts of SMS and review some of its applications, including extremal graph problems like planar Turán numbers, the Earth-Moon coloring problem, Rota's matroid basis conjecture, and the Erdős-Faber-Lovász conjecture on hypergraphs.
en
dc.language.iso
en
-
dc.subject
SAT
en
dc.subject
Isomorph-Free Generation
en
dc.subject
Combinatorial Objects
en
dc.title
Isomorph-Free Generation of Combinatorial Objects with SAT Modulo Symmetries
en
dc.type
Presentation
en
dc.type
Vortrag
de
dc.type.category
Presentation
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E192-01 - Forschungsbereich Algorithms and Complexity
-
tuw.author.orcid
0000-0001-8994-1656
-
tuw.event.name
Extended Reunion: Satisfiability 2023
en
tuw.event.startdate
13-03-2023
-
tuw.event.enddate
12-05-2023
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.country
US
-
tuw.event.presenter
Szeider, Stefan
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
80
-
wb.sciencebranch.value
20
-
item.languageiso639-1
en
-
item.openairetype
conference presentation
-
item.grantfulltext
none
-
item.fulltext
no Fulltext
-
item.cerifentitytype
Publications
-
item.openairecristype
http://purl.org/coar/resource_type/R60J-J5BD
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
