Essence: A constraint language for specifying combinatorial problems

DOI10.1007/S10601-008-9047-YMaRDI QIDQ941817zbMATH OpenOpenAlexFDO

Authors Alan M. Frisch, Warwick Harvey, Chris Jefferson, Bernadette Martínez-Hernández, Ian Miguel

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

zbMATH Keywords

Combinatorial problemsSpecification languagesConstraint programmingConstraint languagesConstraint modelling

Mathematics Subject Classification ID

Theory of programming languages (68N15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Expressive power and abstraction in Essence
• Introduction to the constraint language NCL
• Logic Based Program Synthesis and Transformation
• NP-SPEC: An executable specification language for solving all problems in NP
• The NCL natural constraint language.

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2032420 (Why is no real title available?)
• A language and a program for stating and solving combinatorial problems
• Expressive power and abstraction in Essence
• 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

(29)

• Efficiently explaining CSPs with unsatisfiable subset optimization
• Scenario-based learning for stochastic combinatorial optimisation
• Enumeration of set-theoretic solutions to the Yang-Baxter equation
• From Rules to Constraint Programs with the Rules2CP Modelling Language
• \textsc{Conjure}: automatic generation of constraint models from problem specifications
• Progress towards the Holy Grail
• Finding subgraphs with side constraints
• Automated streamliner portfolios for constraint satisfaction problems
• Lifted Reasoning for Combinatorial Counting
• A semantic account for modularity in multi-language modelling of search problems
• Why CP portfolio solvers are (under)utilized? Issues and challenges
• Exploiting functional constraints in automatic dominance breaking for constraint optimization
• MiniBrass: soft constraints for MiniZinc
• GBOML: a structure-exploiting optimization modelling language in Python
• Solving constraint satisfaction problems with SAT modulo theories
• Logic Based Program Synthesis and Transformation
• Expressive power and abstraction in Essence
• The design of the zinc modelling language
• Essence
• Compiling CP subproblems to MDDs and d-DNNFs
• Towards Copeland optimization in combinatorial problems
• Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
• A review of literature on parallel constraint solving
• Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
• Using dual presolving reductions to reformulate cumulative constraints
• MiningZinc: a declarative framework for constraint-based mining
• scientific article; zbMATH DE number 7453149 (Why is no real title available?)
• Semiring programming: a semantic framework for generalized sum product problems
• Enumerated types and type extensions for MiniZinc

Describes a project that uses

Uses Software

• NP-SPEC
• AMPL
• GAMS
• MiniZinc
• Zinc
• Localizer
• ESRA

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)