Automatically improving constraint models in Savile Row
From MaRDI portal
Publication:1680696
DOI10.1016/j.artint.2017.07.001zbMath1419.68099OpenAlexW2734924814MaRDI QIDQ1680696
Özgür Akgün, Christopher Jefferson, Patrick Spracklen, Ian Miguel, Peter W. Nightingale, Ian Philip Gent
Publication date: 16 November 2017
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://eprints.whiterose.ac.uk/141511/1/savilerowjournal_aij.pdf
modellingconstraint satisfactionpropositional satisfiabilityreformulationcommon subexpression elimination
Related Items
Progress towards the Holy Grail, Constraint programming and operations research, Enumeration of set-theoretic solutions to the Yang–Baxter equation, A review of literature on parallel constraint solving, \textsc{Conjure}: automatic generation of constraint models from problem specifications, Automatically improving constraint models in Savile Row, A constraint-based local search backend for MiniZinc, Learning to select SAT encodings for pseudo-Boolean and linear Integer constraints, Automated streamliner portfolios for constraint satisfaction problems, Solving computational problems in the theory of word-representable graphs, SAT encodings for pseudo-Boolean constraints together with at-most-one constraints, Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints, On the enumeration of finite 𝐿-algebras
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- MiniSat
- The extended global cardinality constraint: an empirical survey
- Implementing logical connectives in constraint programming
- Compiling finite linear CSP into SAT
- A discrete Lagrangian-based global-search method for solving satisfiability problems
- Automatically improving constraint models in Savile Row
- Cost-based arc consistency for global cardinality constraints
- Graph coloring inequalities from all-different systems
- Efficient algorithms for singleton arc consistency
- Design of financial CDO squared transactions using constraint programming
- AI 2006: Advances in artificial intelligence. 19th Australian joint conference on artificial intelligence, Hobart, Australia, December 4--8, 2006. Proceedings
- Inprocessing Rules
- Second-Order Consistencies
- Presolve Reductions in Mixed Integer Programming
- Encodings of the Sequence Constraint
- Towards Robust CNF Encodings of Cardinality Constraints
- Revisiting the Sequence Constraint
- Constraint Handling Rules
- MiniZinc with Functions
- Symmetry and Search in a Network Design Problem
- Cadmium: An Implementation of ACD Term Rewriting
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Principles and Practice of Constraint Programming – CP 2003
- Principles and Practice of Constraint Programming – CP 2003
- Exploiting symmetries within constraint satisfaction search
