Now showing items 1-4 of 4

    • Automatic generation and selection of streamlined constraint models via Monte Carlo search on a model lattice 

      Spracklen, Patrick; Akgun, Ozgur; Miguel, Ian James (Springer, 2018) - Conference item
      Streamlined constraint reasoning is the addition of uninferred constraints to a constraint model to reduce the search space, while retaining at least one solution. Previously it has been established that it is possible to ...
    • Automatically improving constraint models in Savile Row 

      Nightingale, Peter; Akgün, Özgür; Gent, Ian P.; Jefferson, Christopher; Miguel, Ian; Spracklen, Patrick (2017-10) - Journal article
      When solving a combinatorial problem using Constraint Programming (CP) or Satisfiability (SAT), modelling and formulation are vital and difficult tasks. Even an expert human may explore many alternatives in modelling a ...
    • Automatically improving SAT encoding of constraint problems through common subexpression elimination in Savile Row 

      Nightingale, Peter; Spracklen, Patrick; Miguel, Ian James (Springer, 2015-10) - Conference item
      The formulation of a Propositional Satisfiability (SAT) problem instance is vital to efficient solving. This has motivated research on preprocessing, and inprocessing techniques where reformulation of a SAT instance is ...
    • A framework for constraint based local search using ESSENCE 

      Akgun, Ozgur; Attieh, Saad Wasim A; Gent, Ian Philip; Jefferson, Christopher Anthony; Miguel, Ian James; Nightingale, Peter William; Salamon, András Z.; Spracklen, Patrick; Wetter, James Patrick (International Joint Conferences on Artificial Intelligence, 2018-07-13) - Conference item
      Structured Neighbourhood Search (SNS) is a framework for constraint-based local search for problems expressed in the Essence abstract constraint specification language. The local search explores a structured neighbourhood, ...