MiniZinc: Towards a Standard CP Modelling Language

  title={MiniZinc: Towards a Standard CP Modelling Language},
  author={Nicholas Nethercote and Peter James Stuckey and Ralph Becket and Sebastian Brand and Gregory J. Duck and Guido Tack},
There is no standard modelling language for constraint programming (CP) problems. Most solvers have their own modelling language. This makes it difficult for modellers to experiment with different solvers for a problem. In this paper we present MiniZinc, a simple but expressive CP modelling language which is suitable for modelling problems for a range of solvers and provides a reasonable compromise between many design possibilities. Equally importantly, we also propose a low-level solver… 

Embedding MiniZinc ?

This project will turn MiniZinc from a modelling language into a modelling middleware, a library that can be embedded into other pieces of software.

MiniSearch: A Solver-Independent Meta-Search Language for MiniZinc

MINISEARCH is presented, a meta-search language that can directly use any FLATZINC solver and can interact with solvers through an efficient C++ API, and the expressiveness of the language and performance is illustrated.

Optimising Quantified Expressions in Constraint Models

The experimental results show that quantified expression optimisations can reduce solving time very considerably, and new constraint model optimisation techniques concerned with optimising quantified expressions at problem class level are presented.

Natural optimisation modelling for software developers

The aim of this thesis is to demonstrate the potential for an interface to a constraint solver which is much more approachable for general software developers, in order to promote wider use of the technology.

Declarative Local-Search Neighbourhoods in MiniZinc

This work shows how to extend MiniZinc so that one can attach a fully declarative neighbourhood specification to a model, while maintaining the solver-independence of the language.

A General Local Search Solver for FlatZinc

Quite a few FlatZinc solvers are publicly available in the research community, but, up to the knowl-edge, none of them uses meta-heuristics.

Towards a Lightweight Standard Search Language

A lightweight search language for MiniZinc that allows a user to direct the search process by employing explicitly defined search templates that is solver-independent, does not impose high requirements on underlying constraint solvers, and enables users to construct search strategies to tackle problems successfully at a sufficiently abstract level.

On the Pursuit of a Standard Language for Object-Oriented Constraint Modeling

The s-COMMA modeling language and its execution platform is introduced and it is believed the work done represents a concrete step on the pursuit of a standard constraint modeling language.

Search combinators

Search combinators is introduced, a lightweight and solver-independent method that bridges the gap between a conceptually simple modeling language for search and an efficient implementation (low-level, imperative and highly non-modular).

The Evolving World of MiniZinc

The features of MiniZinc that the authors believe are most pertinent to making a realistic standard are discussed, and what is added and subtracted from the language to make the task of the solver developer easier are discussed.



Minion: A Fast Scalable Constraint Solver

Minion is a general-purpose constraint solver, with an expressive input language based on the common constraint modelling device of matrix models, which makes it a substantial step towards Puget's 'Model and Run' constraint solving paradigm.

Introducing ESRA, a Relational Language for Modelling Combinatorial Problems

A higher-level, simpler, and smaller modelling notation is needed to unleash the proven powers of constraint technology and make it available to a wider range of people.

CSPLIB: A Benchmark Library for Constraints

A model benchmark library should contain as diverse and large a set of problems as possible, be independent of any particular constraint solver, and contain neither just hard (nor just easy) problems.

ACD Term Rewriting

The semantics of ACDTR are defined and the prototype implementation of the language is described, which can be seen as a general logic programming language that extends Constraint Handling Rules and AC term rewriting.

Towards "Propagation = Logic + Control"

This work argues for the appropriateness of their controlled propagation framework by showing that it captures the underlying principles of manually designed propagation algorithms, such as literal watching for unit clause propagation and the lexicographic ordering constraint.

Logic Programming

  • K. Apt
  • Computer Science
    Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990

Essence: A constraint language for specifying combinatorial problems

Essence is a formal language for specifying combinatorial problems in a manner similar to natural rigorous specifications that use a mixture of natural language and discrete mathematics. Essence

Principles and Practice of Constraint Programming - CP 2006, 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006, Proceedings

Constraint Programming and Local Search Solve the Scheduling Problem of Electricite de France Nuclear Power Plant Outages and more.

Constraint logic programming using Eclipse

Providing an introduction to constraint programming, as well as a systematic introduction to the Eclipse system, this text shows how to write constraint programs that solve complex problems, and

The OPL optimization programming language

Part 1 The language: a short tour of OPL models data modelling expressions and constraints formal parameters search display. Part 2 The application areas: linear and integer programming constraint