MiniZinc: Towards a Standard CP Modelling Language

Nethercote, Nicholas; Stuckey, Peter J.; Becket, Ralph; Brand, Sebastian; Duck, Gregory J.; Tack, Guido

doi:10.1007/978-3-540-74970-7_38

Cited by 543 publications

(374 citation statements)

References 5 publications

Supporting

Mentioning

347

Contrasting

Order By: Relevance

“…It is also straightforward to add new output languages supported by an alternate sequence of transformations. At present Savile Row is at an early stage of development compared to other tools such as MiniZinc [38]. However it has some features that are particularly relevant to qualitative modelling, and its extensibility makes it suitable for the future work we describe below.…”

Section: Essence and Savile Rowmentioning

confidence: 99%

Qualitative modelling via constraint programming

et al. 2014

View full text Add to dashboard Cite

Abstract. Qualitative modelling is a technique integrating the fields of theoretical computer science, artificial intelligence and the physical and biological sciences. The aim is to be able to model the behaviour of systems without estimating parameter values and fixing the exact quantitative dynamics. Traditional applications are the study of the dynamics of physical and biological systems at a higher level of abstraction than that obtained by estimation of numerical parameter values for a fixed quantitative model. Qualitative modelling has been studied and implemented to varying degrees of sophistication in Petri nets, process calculi and constraint programming. In this paper we reflect on the strengths and weaknesses of existing frameworks, we demonstrate how recent advances in constraint programming can be leveraged to produce high quality qualitative models, and we describe the advances in theory and technology that would be needed to make constraint programming the best option for scientific investigation in the broadest sense.

show abstract

Section: Essence and Savile Rowmentioning

confidence: 99%

Qualitative modelling via constraint programming

et al. 2014

View full text Add to dashboard Cite

show abstract

“…For this DSL we use a concrete syntax, in the form of nested terms, that is compatible with the annotation language of MiniZinc [9], a popular language for modeling combinatorial problems.…”

Section: Brief Dsl Overviewmentioning

confidence: 99%

Memoizing a Monadic Mixin DSL

Wuille

Schrijvers

Samulowitz³

et al. 2011

Functional and Constraint Logic Programming

Self Cite

View full text Add to dashboard Cite

Abstract. Modular extensibility is a highly desirable property of a domain-specific language (DSL): the ability to add new features without affecting the implementation of existing features. Functional mixins (also known as open recursion) are very suitable for this purpose. We study the use of mixins in Haskell for a modular DSL for search heuristics used in systematic solvers for combinatorial problems, that generate optimized C ++ code from a high-level specification. We show how to apply memoization techniques to tackle performance issues and code explosion due to the high recursion inherent to the semantics of combinatorial search. As such heuristics are conventionally implemented as highly entangled imperative algorithms, our Haskell mixins are monadic. Memoization of monadic components causes further complications for us to deal with.

show abstract

“…We took advantage of the existing compiler from MiniZinc to FlatZinc [4] and thus focused on the translation from FlatZinc to CNT. Being these two languages rather similar in spirit, the translation is straightforward.…”

Section: Minizinc (Flatzinc) Into Cntmentioning

confidence: 99%

“…We report the fragment of the N-Queens problem where diagonal constraints are set. MiniZinc is a high-level modeling language developed by the NICTA research group [4]. It allows to express most CP problems easily, supporting sets, arrays, user defined predicates, some automatic coercions, and so on.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Compiling and Executing Declarative Modeling Languages to Gecode

2008

View full text Add to dashboard Cite

Abstract. We developed a compiler from SICStus Prolog CLP(FD) to Gecode and a compiler from MiniZinc to Gecode. We compared the running times of the executions of (standard) codes directly in the three languages and of the compiled codes for some classical problems. Performances of the compiled codes in Gecode improve those in the original languages and are comparable with running time of native Gecode code. This is a first step towards the definition of a unified declarative modeling tool for combinatorial problems.

show abstract

MiniZinc: Towards a Standard CP Modelling Language

Cited by 543 publications

References 5 publications

Qualitative modelling via constraint programming

Qualitative modelling via constraint programming

Memoizing a Monadic Mixin DSL

Compiling and Executing Declarative Modeling Languages to Gecode

Contact Info

Product

Resources

About