\textsc{Conjure}: automatic generation of constraint models from problem specifications
From MaRDI portal
Publication:2163883
Cites work
- A complete solution to the maximum density still life problem
- A method for detecting symmetries in constraint models and its generalisation
- Automatically improving constraint models in Savile Row
- Cardinality networks: a theoretical and empirical study
- Compiling finite linear CSP into SAT
- Conditional Symmetry Breaking
- Constraint acquisition
- Constraint and integer programming in OPL
- Constraint models for graceful graphs
- Constraint models for the covering test problem
- Constraint programming and hybrid formulations for three life designs
- Embedding partial Steiner triple systems is NP-complete
- Essence: A constraint language for specifying combinatorial problems
- Exploiting symmetries within constraint satisfaction search
- Handbook of constraint programming.
- scientific article; zbMATH DE number 4162321 (Why is no real title available?)
- scientific article; zbMATH DE number 1252517 (Why is no real title available?)
- scientific article; zbMATH DE number 605917 (Why is no real title available?)
- scientific article; zbMATH DE number 1975610 (Why is no real title available?)
- scientific article; zbMATH DE number 2032420 (Why is no real title available?)
- scientific article; zbMATH DE number 2080324 (Why is no real title available?)
- scientific article; zbMATH DE number 2084734 (Why is no real title available?)
- scientific article; zbMATH DE number 2084742 (Why is no real title available?)
- Increasing constraint propagation by redundant modeling: An experience report
- Integer Linear Programming and Constraint Programming Approaches to a Template Design Problem
- Integer linear programming model for multidimensional two-way number partitioning 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
- meSAT: multiple encodings of CSP to SAT
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- NP-SPEC: An executable specification language for solving all problems in NP
- On implementing symmetry detection
- Open-WBO: a modular MaxSAT solver
- Principles and Practice of Constraint Programming – CP 2003
- Principles and Practice of Constraint Programming – CP 2004
- Progress towards the Holy Grail
- Propagation redundancy in redundant modelling
- Revisiting global constraint satisfaction
- Scheduling sport tournaments using constraint logic programming
- Symmetry and Search in a Network Design Problem
- The design of the zinc modelling language
- The quickest transshipment problem
- Theory and Applications of Satisfiability Testing
- Unsolved problems in number theory
Cited in
(7)- Lifted Reasoning for Combinatorial Counting
- Automated streamliner portfolios for constraint satisfaction problems
- Generating streamlining constraints with large language models
- Composable constraint models for permutation enumeration
- Breaking the symmetries of indistinguishable objects
- \textsc{Athanor}: local search over abstract constraint specifications
- Digraph-defined external difference families and new circular external difference families
Describes a project that uses
Uses Software
This page was built for publication: \textsc{Conjure}: automatic generation of constraint models from problem specifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163883)
