Automatically improving constraint models in Savile Row
type: Item
instance of: scholarly article
title: Automatically improving constraint models in Savile Row
zbMATH Open document ID: 1419.68099
author: Özgür Akgün
author: Christopher Jefferson
author: Ian Miguel
author: Patrick Spracklen
author: Peter W. Nightingale
author: Ian P. Gent
published in: Artificial Intelligence
publication date: 2017-11-16T00:00:00Z
full work available at URL: savilerowjournal aij.pdf
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6807710
zbMATH Keywords: constraint satisfaction
zbMATH Keywords: common subexpression elimination
zbMATH Keywords: modelling
zbMATH Keywords: reformulation
zbMATH Keywords: propositional satisfiability
cites work: MiniSat
cites work: Presolve Reductions in Mixed Integer Programming
cites work: Graph coloring inequalities from all-different systems
cites work: Efficient algorithms for singleton arc consistency
cites work: Q5503674
cites work: Encodings of the Sequence Constraint
cites work: AI 2006: Advances in artificial intelligence. 19th Australian joint conference on artificial intelligence, Hobart, Australia, December 4--8, 2006. Proceedings
cites work: Cadmium: An Implementation of ACD Term Rewriting
cites work: Theory and Applications of Satisfiability Testing
cites work: Design of financial CDO squared transactions using constraint programming
cites work: Principles and Practice of Constraint Programming – CP 2003
cites work: Q4424851
cites work: Constraint Handling Rules
cites work: Q5538306
cites work: Revisiting the Sequence Constraint
cites work: Inprocessing Rules
cites work: Implementing logical connectives in constraint programming
cites work: Second-Order Consistencies
cites work: Exploiting symmetries within constraint satisfaction search
cites work: The extended global cardinality constraint: an empirical survey
cites work: Cost-based arc consistency for global cardinality constraints
cites work: Q3184605
cites work: A discrete Lagrangian-based global-search method for solving satisfiability problems
cites work: Towards Robust CNF Encodings of Cardinality Constraints
cites work: Symmetry and Search in a Network Design Problem
cites work: MiniZinc with Functions
cites work: Compiling finite linear CSP into SAT
cites work: Q4473043
describes a project that uses: MiniSat
describes a project that uses: Gecode
describes a project that uses: CSPLib
describes a project that uses: CVC4
describes a project that uses: MINION
describes a project that uses: Cadmium
describes a project that uses: Chaff
describes a project that uses: MiniZinc
describes a project that uses: Sugar
MaRDI profile type: Publication
OpenAlex ID: W2734924814
DOI: 10.1016/J.ARTINT.2017.07.001
description: scientific article; zbMATH DE number 6807710