Essence: A constraint language for specifying combinatorial problems
From MaRDI portal
Publication:941817
DOI10.1007/s10601-008-9047-yzbMath1147.68424OpenAlexW2016030731MaRDI QIDQ941817
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
Constraint programmingCombinatorial problemsSpecification languagesConstraint languagesConstraint modelling
Theory of programming languages (68N15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (25)
Progress towards the Holy Grail ⋮ A Semantic Account for Modularity in Multi-language Modelling of Search Problems ⋮ Enumeration of set-theoretic solutions to the Yang–Baxter equation ⋮ A review of literature on parallel constraint solving ⋮ \textsc{Conjure}: automatic generation of constraint models from problem specifications ⋮ Towards Copeland optimization in combinatorial problems ⋮ Enumerated types and type extensions for MiniZinc ⋮ Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP3 ⋮ Automated streamliner portfolios for constraint satisfaction problems ⋮ Semiring programming: a semantic framework for generalized sum product problems ⋮ Unnamed Item ⋮ 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 ⋮ The design of the zinc modelling language ⋮ Expressive power and abstraction in Essence ⋮ MiningZinc: a declarative framework for constraint-based mining ⋮ Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges ⋮ Scenario-based learning for stochastic combinatorial optimisation ⋮ From Rules to Constraint Programs with the Rules2CP Modelling Language ⋮ Essence ⋮ MiniBrass: soft constraints for MiniZinc ⋮ Compiling CP subproblems to MDDs and d-DNNFs ⋮ Lifted Reasoning for Combinatorial Counting ⋮ Finding subgraphs with side constraints
Uses Software
Cites Work
- The design of the zinc modelling language
- Expressive power and abstraction in Essence
- A language and a program for stating and solving combinatorial problems
- Localizer
- NP-SPEC: an executable specification language for solving all problems in NP
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Logic Based Program Synthesis and Transformation
- Unnamed Item
- Unnamed Item
This page was built for publication: Essence: A constraint language for specifying combinatorial problems