Automatically improving constraint models in Savile Row

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 single problem. We make a number of contributions in the automated modelling and...

Full description

Saved in:

Bibliographic Details
Published in:	Artificial intelligence Vol. 251; pp. 35 - 61
Main Authors:	Nightingale, Peter, Akgün, Özgür, Gent, Ian P., Jefferson, Christopher, Miguel, Ian, Spracklen, Patrick
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.10.2017 Elsevier Science Ltd
Subjects:	Combinatorial analysis Common subexpression elimination Commutativity Computer programming Constraint modelling Constraint satisfaction Modelling Problem solving Propositional satisfiability Reformulation Theory of constraints Constraint satisfaction Common subexpression elimination Modelling Propositional satisfiability Reformulation
ISSN:	0004-3702, 1872-7921
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!