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.2021.19
URN: urn:nbn:de:0030-drops-153106
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/15310/
Carissan, Yannick ;
Hagebaum-Reignier, Denis ;
Prcovic, Nicolas ;
Terrioux, Cyril ;
Varet, Adrien
Exhaustive Generation of Benzenoid Structures Sharing Common Patterns
Abstract
Benzenoids are a subfamily of hydrocarbons (molecules that are only made of hydrogen and carbon atoms) whose carbon atoms form hexagons. These molecules are widely studied both experimentally and theoretically and can have various physicochemical properties (mechanical resistance, electronic conductivity, ...) from which a lot of concrete applications are derived. These properties can rely on the existence or absence of fragments of the molecule corresponding to a given pattern (some patterns impose the nature of certain bonds, which has an impact on the whole electronic structure). The exhaustive generation of families of benzenoids sharing the absence or presence of given patterns is an important problem in chemistry, particularly in theoretical chemistry, where various methods can be used to better understand the link between their shapes and their electronic properties.
In this paper, we show how constraint programming can help chemists to answer different questions around this problem. To do so, we propose different models including one based on a variant of the subgraph isomorphism problem and we generate the desired structures using Choco solver.
BibTeX - Entry
@InProceedings{carissan_et_al:LIPIcs.CP.2021.19,
author = {Carissan, Yannick and Hagebaum-Reignier, Denis and Prcovic, Nicolas and Terrioux, Cyril and Varet, Adrien},
title = {{Exhaustive Generation of Benzenoid Structures Sharing Common Patterns}},
booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)},
pages = {19:1--19:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-211-2},
ISSN = {1868-8969},
year = {2021},
volume = {210},
editor = {Michel, Laurent D.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/15310},
URN = {urn:nbn:de:0030-drops-153106},
doi = {10.4230/LIPIcs.CP.2021.19},
annote = {Keywords: Constraint satisfaction problem, modeling, pattern, application, theoretical chemistry}
}
