Exploring chemistry using SMT

  • Authors:
  • Rolf Fagerberg;Christoph Flamm;Daniel Merkle;Philipp Peters

  • Affiliations:
  • Department of Mathematics and Computer Science, University of Southern Denmark, Denmark;Institute for Theoretical Chemistry, University of Vienna, Austria;Department of Mathematics and Computer Science, University of Southern Denmark, Denmark;Department of Mathematics and Computer Science, University of Southern Denmark, Denmark

  • Venue:
  • CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

How to synthesize molecules is a fundamental and well studied problem in chemistry. However, computer aided methods are still under-utilized in chemical synthesis planning. Given a specific chemistry (a set of chemical reactions), and a specified overall chemical mechanism, a number of exploratory questions are of interest to a chemist. Examples include: what products are obtainable, how to find a minimal number of reactions to synthesize a certain chemical compound, and how to map a specific chemistry to a mechanism. We present a Constraint Programming based approach to these problems and employ the expressive power of Satisfiability Modulo Theory (SMT) solvers. We show results for an analysis of the Pentose Phosphate Pathway and the Biosynthesis of 3-Hydroxypropanoate. The main novelty of the paper lies in the usage of SMT for expressing search problems in chemistry, and in the generality of its resulting computer aided method for synthesis planning.