Open Access
Program synthesis for combinatorial optimisation problems: Position statement
Pierre Flener
- 01 Jan 2002
TL;DR: 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.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
Alma-0: An imperative language that supports declarative programming
TL;DR: Alma as mentioned in this paper is an implemented small programming language that augments the expressive power of imperative programming by a limited number of features inspired by the logic programming paradigm, making it a more attractive vehicle for problems that involve search.
7
References
Alloy: a lightweight object modelling notation
TL;DR: This paper presents the Alloy language in its entirety, and explains its motivation, contributions and deficiencies.
Permutation Problems and Channelling Constraints
Toby Walsh
- 03 Dec 2001
TL;DR: This paper performs an extensive theoretical and empirical study of different constraint models, hoping that the results will aid constraint programmers to choose a model for a permutation problem and illustrate a general methodology for comparing different constraints models.
Symmetry in matrix models
Pierre Flener,AM Frisch,Brahim Hnich,Zeynep Kiziltan,Ian Miguel,Justin Pearson,Toby Walsh +6 more
- 01 Jan 2001
TL;DR: This work study and generalise symmetry-breaking techniques, such as lexicographic ordering, and proposes a labelling technique achieving the same effect.
33
Compiling High-Level Type Constructors in Constraint Programming
Pierre Flener,Brahim Hnich,Zeynep Kiziltan +2 more
- 11 Mar 2001
TL;DR: A practical set constraint language, called esra, is designed by incorporating high-level type constructors for constraint programming languages, so that constraint satisfaction problems can be modelled in very expressive ways.
23
Towards Inferring Labelling Heuristics for CSP Application Domains
TL;DR: The approach is to first formalise a CSP application domain as a family of models so as to exhibit the generic constraint store for all models in that family, and to advocate inferring (known or new) heuristics for application domains.
12