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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Artificial intelligence Ročník 251; s. 35 - 61
Hlavní autori:	Nightingale, Peter, Akgün, Özgür, Gent, Ian P., Jefferson, Christopher, Miguel, Ian, Spracklen, Patrick
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 01.10.2017 Elsevier Science Ltd
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!