Conjure: The Automated Constraint Modelling Tool

Table of Contents

• Welcome
• Introduction
• Installation
  • Downloading a binary
  • Compiling from source
  • Installing Savile Row
  • Compiling the documentation
• Command Line Interface
  • Help output
• Features
  • Problem classes
  • High level of abstraction
  • Arbitrarily nested types
  • Automatic symmetry breaking
  • Multiple models
  • Automated channelling
  • Extensibility
  • Multiple target solvers
• Conjure’s input language: Essence
  • Declarations
    • Declaring decision variables
    • Declaring parameters
    • Declaring aliases
    • Declaring enumerated types
    • Declaring unnamed types
  • Branching statements
  • Constraints
  • Instantiation conditions
  • Objective statements
  • Names
  • Domains
    • Boolean domains
    • Integer domains
    • Enumerated domains
    • Unnamed domains
    • Tuple domains
    • Record domains
    • Variant domains
    • Matrix domains
    • Set domains
    • Multi-set domains
    • Function domains
    • Sequence domains
    • Relation domains
    • Partition domains
  • Types
  • Expressions
    • Matrix indexing
    • Tuple indexing
    • Arithmetic operators
    • Comparisons
    • Logical operators
    • Set operators
    • Sequence operators
    • Enumerated type operators
    • Multiset operators
    • Type conversion operators
    • Function operators
    • Matrix operators
    • Partition operators
    • List combining operators
    • Comprehensions
    • Miscellaneous examples
• Tutorials
  • Number puzzle
    • Initial model
    • Identifying a missing constraint
    • Final model
  • The Knapsack problem
  • Nurse rostering
    • Initial specification
    • Changing an overly restrictive assumption
    • Final model
  • Labelled connected graphs
    • Model 1: distance matrix
    • Model 2: reachability matrix
    • Model 3: structured reachability matrices
    • Model 4: connected component
    • Model 5: minimal connected component
    • Generating all connected graphs
  • Futoshiki
    • Problem
    • Essence Model
    • Instance
    • Solving
  • BIBD
    • The Problem
    • The Model
    • Improvements
  • Semigroups, Monoids and Groups
    • The Problem
    • Semigroups
    • Monoids
    • Groups
  • Handcrafting Instance Generators in Essence
    • Instances for the Knapsack problem
  • Simple Permutations
    • Problem
    • Enumeration/Generation Model
    • Parameter
    • Solving
    • Checking Model
    • Instances
    • Solving
• Tutorials using Conjure notebook
  • The Knapsack problem
    • Model Explained
    • Solving the problem
    • Visualisations:
  • Nurse Rostering
    • Initial specification
    • Changing an overly restrictive assumption
    • Final model
    • Python datatypes
    • Visualisations
  • Futoshiki
    • Problem
    • Instance
    • Solving the problem step by step
    • Visualising the results
  • Semigroups, Monoids and Groups
    • The Problem
    • Semigroups
    • Monoids
    • Groups
  • Handcrafting Instance Generators in Essence
    • Instances for the Knapsack problem
  • Simple Permutations
    • Problem
    • Parameter
    • Enumeration/Generation Model
    • Solving
    • Checking Model with Instances
• References
• Contact
  • Contributors