Essence: A constraint language for specifying combinatorial problems
From MaRDI portal
Recommendations
Cites work
- A language and a program for stating and solving combinatorial problems
- Expressive power and abstraction in Essence
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2032420 (Why is no real title available?)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Localizer
- Logic Based Program Synthesis and Transformation
- NP-SPEC: An executable specification language for solving all problems in NP
- The design of the zinc modelling language
Cited in
(33)- Progress towards the Holy Grail
- Scenario-based learning for stochastic combinatorial optimisation
- Finding subgraphs with side constraints
- \textsc{Conjure}: automatic generation of constraint models from problem specifications
- Towards Copeland optimization in combinatorial problems
- Enumerated types and type extensions for MiniZinc
- Semiring programming: a semantic framework for generalized sum product problems
- MiniBrass: soft constraints for MiniZinc
- Compiling CP subproblems to MDDs and d-DNNFs
- A semantic account for modularity in multi-language modelling of search problems
- Essence
- A review of literature on parallel constraint solving
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
- Solving constraint satisfaction problems with SAT modulo theories
- Using dual presolving reductions to reformulate cumulative constraints
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
- scientific article; zbMATH DE number 7453149 (Why is no real title available?)
- Enumeration of set-theoretic solutions to the Yang-Baxter equation
- MiningZinc: a declarative framework for constraint-based mining
- From Rules to Constraint Programs with the Rules2CP Modelling Language
- Logic Based Program Synthesis and Transformation
- Why CP portfolio solvers are (under)utilized? Issues and challenges
- Lifted Reasoning for Combinatorial Counting
- Automated streamliner portfolios for constraint satisfaction problems
- Exploiting functional constraints in automatic dominance breaking for constraint optimization
- Efficiently explaining CSPs with unsatisfiable subset optimization
- GBOML: a structure-exploiting optimization modelling language in Python
- Composable constraint models for permutation enumeration
- Automatic error function learning with interpretable compositional networks
- \textsc{Athanor}: local search over abstract constraint specifications
- Machine learning-guided interactive constraint acquisition
- The design of the zinc modelling language
- Expressive power and abstraction in Essence
This page was built for publication: Essence: A constraint language for specifying combinatorial problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941817)
