Category:MiniZinc: Difference between revisions
Content added Content deleted
(Add page contents) |
(Add language tag) |
||
| Line 6: | Line 6: | ||
|compat=nominative |
|compat=nominative |
||
|express=explicit |
|express=explicit |
||
|checking=static |
|checking=static |
||
|tags=minizinc}} |
|||
MiniZinc is a constraint modeling language developed by G12. It was originally a subset of Zinc, but has since gained additional capabilities. It compiles to a minimal subset called FlatZinc, which is interpreted by [https://www.minizinc.org/software.html#flatzinc constraint solvers]. |
MiniZinc is a constraint modeling language developed by G12. It was originally a subset of Zinc, but has since gained additional capabilities. It compiles to a minimal subset called FlatZinc, which is interpreted by [https://www.minizinc.org/software.html#flatzinc constraint solvers]. |
||
Latest revision as of 21:13, 24 October 2019
This programming language may be used to instruct a computer to perform a task.
| Official website |
|---|
| Execution method: | Interpreted |
|---|---|
| Type safety: | Safe |
| Type strength: | Weak |
| Type compatibility: | Nominative |
| Type expression: | Explicit |
| Type checking: | Static |
| Lang tag(s): | minizinc |
| See Also: |
|
MiniZinc is a constraint modeling language developed by G12. It was originally a subset of Zinc, but has since gained additional capabilities. It compiles to a minimal subset called FlatZinc, which is interpreted by constraint solvers.
MiniZinc can be used to state satisfaction and optimization problems in a high-level, declarative fashion. It provides a standard library of common constraints, which can help modelers to formulate their models both readably and efficiently.
MiniZinc is at the heart of the MiniZinc Challenge, a yearly competition that ranks constraint solvers on their ability to handle a wide array of satisfaction and optimization problems.
Pages in category "MiniZinc"
The following 31 pages are in this category, out of 31 total.