\textsc{Conjure}: automatic generation of constraint models from problem specifications
From MaRDI portal
Publication:2163883
DOI10.1016/j.artint.2022.103751OpenAlexW4281681103MaRDI QIDQ2163883
Christopher Jefferson, Ian Miguel, Özgür Akgün, Alan M. Frisch, Ian Philip Gent, Peter W. Nightingale
Publication date: 11 August 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2022.103751
Related Items (2)
Automated streamliner portfolios for constraint satisfaction problems ⋮ Lifted Reasoning for Combinatorial Counting
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constraint acquisition
- Cardinality networks: a theoretical and empirical study
- Integer linear programming model for multidimensional two-way number partitioning problem
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- Embedding partial Steiner triple systems is NP-complete
- Compiling finite linear CSP into SAT
- Constraint models for the covering test problem
- The design of the zinc modelling language
- Essence: A constraint language for specifying combinatorial problems
- On implementing symmetry detection
- Revisiting global constraint satisfaction
- Scheduling sport tournaments using constraint logic programming
- Increasing constraint propagation by redundant modeling: An experience report
- Progress towards the Holy Grail
- Automatically improving constraint models in Savile Row
- A complete solution to the maximum density still life problem
- Constraint programming and hybrid formulations for three life designs
- Constraint models for graceful graphs
- meSAT: multiple encodings of CSP to SAT
- A method for detecting symmetries in constraint models and its generalisation
- NP-SPEC: an executable specification language for solving all problems in NP
- The Quickest Transshipment Problem
- Constraint and Integer Programming in OPL
- Open-WBO: A Modular MaxSAT Solver,
- Conditional Symmetry Breaking
- Integer Linear Programming and Constraint Programming Approaches to a Template Design Problem
- Theory and Applications of Satisfiability Testing
- Symmetry and Search in a Network Design Problem
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Logic Based Program Synthesis and Transformation
- Principles and Practice of Constraint Programming – CP 2003
- Principles and Practice of Constraint Programming – CP 2003
- Principles and Practice of Constraint Programming – CP 2004
- Unsolved problems in number theory
- Exploiting symmetries within constraint satisfaction search
This page was built for publication: \textsc{Conjure}: automatic generation of constraint models from problem specifications
