Program Synthesis for Combinatorial Optimization Problems

Pierre Flener

A high-level abstract-datatype-based constraint modelling language opens the door to an automatable empirical determination -- by a synthesiser -- of how to 'best' represent the decision variables of a combinatorial optimisation problem, based on (real-life) training instances of the problem. the extreme case where no such training instances are provided, such a synthesiser would simply be non-deterministic. A first-order relational calculus is a good candidate for such a language, as it gives rise to very natural and easy-to-maintain models of combinatorial optimisation problems.

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.