Essence: A constraint language for specifying combinatorial problems
DOI10.1007/S10601-008-9047-YzbMATH Open1147.68424OpenAlexW2016030731MaRDI QIDQ941817FDOQ941817
Alan M. Frisch, Ian Miguel, Chris Jefferson, Bernadette Martínez-Hernández, Warwick Harvey
Publication date: 2 September 2008
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-008-9047-y
Recommendations
Combinatorial problemsSpecification languagesConstraint programmingConstraint languagesConstraint modelling
Theory of programming languages (68N15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- NP-SPEC: An executable specification language for solving all problems in NP
- Localizer
- Logic Based Program Synthesis and Transformation
- Title not available (Why is that?)
- The design of the zinc modelling language
- A language and a program for stating and solving combinatorial problems
- Title not available (Why is that?)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Expressive power and abstraction in Essence
Cited In (29)
- MiniBrass: soft constraints for MiniZinc
- Progress towards the Holy Grail
- Finding subgraphs with side constraints
- Semiring programming: a semantic framework for generalized sum product problems
- GBOML: a structure-exploiting optimization modelling language in Python
- Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges
- Logic Based Program Synthesis and Transformation
- Lifted Reasoning for Combinatorial Counting
- Scenario-based learning for stochastic combinatorial optimisation
- Towards Copeland optimization in combinatorial problems
- A review of literature on parallel constraint solving
- The design of the zinc modelling language
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP3
- Title not available (Why is that?)
- From Rules to Constraint Programs with the Rules2CP Modelling Language
- \textsc{Conjure}: automatic generation of constraint models from problem specifications
- Automated streamliner portfolios for constraint satisfaction problems
- Essence
- Efficiently explaining CSPs with unsatisfiable subset optimization
- Enumerated types and type extensions for MiniZinc
- Solving constraint satisfaction problems with SAT modulo theories
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
- Using dual presolving reductions to reformulate cumulative constraints
- Exploiting functional constraints in automatic dominance breaking for constraint optimization
- Enumeration of set-theoretic solutions to the Yang–Baxter equation
- A Semantic Account for Modularity in Multi-language Modelling of Search Problems
- MiningZinc: a declarative framework for constraint-based mining
- Expressive power and abstraction in Essence
- Compiling CP subproblems to MDDs and d-DNNFs
Uses Software
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)
