KIDS: A Semiautomatic Program Development System
IEEE Transactions on Software Engineering
The OPL optimization programming language
The OPL optimization programming language
On the representation and management of finite sets in CLP languages
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
NP-SPEC: An Executable Specification Language for Solving All Problems in NP
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
A Meta-heuristic for Subset Problems
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
Toward a Classification Approach to Design
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
Planware ¾ Domain-Specific Synthesis of High-Performance Schedulers
ASE '98 Proceedings of the 13th IEEE international conference on Automated software engineering
Schema-Guided Synthesis of Constraint Logic Programs
ASE '98 Proceedings of the 13th IEEE international conference on Automated software engineering
A Meta-heuristic for Subset Problems
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
Towards Inferring Labelling Heuristics for CSP Application Domains
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Recent Advances in Constraints
Integrating Finite Domain and Set Constraints into a Set-based Constraint Language
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
| Hi-index | 0.00 |
We propose high-level type constructors for constraint programming languages, so that constraint satisfaction problems can be modelled in very expressive ways. We design a practical set constraint language, called esra, by incorporating these ideas on top of OPL. A set of rewrite rules achieves compilation from esra into OPL, yielding programs that are often very similar to those that a human opl modeller would (have to) write anyway, so that there is no loss in solving efficiency.