A collection (a ZIP file, 29MB) of exam problems on
organic chemistry synthesis
(updated July 20, 2017, initially posted on September 21st, 2016).
They are formulated in the basic STRIPS fragment of PDDL with types that is
extended with negation of equality. The organic synthesis problem
requires finding a sequence of reactions that can produce the target molecule from
a given set of initial molecules. Most of these problems are taken from the past undergraduate
organic chemistry exams offered at the MIT (Massachusetts Institute of Technology).
This set of exam problems is distributed as a benchmark to encourage development of
new efficient Artificial Intelligence planners that can compete with humans solving
the organic synthesis problem. The Planning Domain Definition Language (PDDL) is
a computer language developed for international planning competitions. This benchmark and
its provenance are described in the SPARK-2016 and GCAI-2015 papers linked below.
Please cite these papers if you publish your research related to this benchmark.
The GCAI-2015 paper mentions a different formulation with the PDDL derived
predicates (axioms), but the PDDL domain in the linked ZIP file does not use them,
for simplicity. (Warning: you may need to introduce the :negated-preconditions
requirement to the :requirements list to make sure your planner can properly process
this domain file.)
This benchmark was part of the domain submission that received the
Outstanding Domain Submission Award
(scroll to the bottom of the Web page)
awarded by the Organizers of the 2018 International Planning Competition to Hadi Qovaizi,
Arman Masoumi, Anne Johnson, Russell Viirre, Andrew McWilliams, and Mikhail Soutchanski
(Faculty of Science, Ryerson University).
The results were presented at the 28th International Conference on
Automated Planning and Scheduling on Friday, June 29 in Delft, Netherlands.