 |
 |
|
This project is conducted by researchers at the University of York and the University of St. Andrews. The project's aim is to develop an automated system that, given a specification of a problem, can generate one or more constraint programs that can solve the problem.
ESSENCE is a language we are developing; it allows a combinatorial (optimisation) problem to be sepcified at a level of abstraction above that at which modelling decisions are made. Version 1.1.0 of the language is now fully defined.
ESSENCE: A Constraint Language for Specifying Combinatorial Problems. By Alan M Frisch, Warwick Harvey, Chris Jefferson, Bernadette Martinez Hernandez and Ian Miguel. To appear in Constraints, 13(3),July 2008. Specification Catalog A catalogue of problems and their specifications in ESSENCE and other languages. This catalogue can also be accessed through a tree that organises the problems into categories. Other Papers on ESSENCE The Design of ESSENCE: A Constraint Language for Specifying Combinatorial Problems. By Alan M Frisch, Matthew Grum, Chris Jefferson, Bernadette Martinez Hernandez and Ian Miguel. Proc. of the 20th International Joint Conference on Artificial Intelligence (IJCAI), January 2007.
The Concept and Provenance of Unnamed, Indistinguishable Types. By Alan M Frisch and Ian Miguel. September, 2006. The Essence of ESSENCE: A Constraint Language for Specifying Combinatorial Problems,. By Alan M Frisch, Matthew Grum, Chris Jefferson, Bernadette Martinez Hernandez and Ian Miguel. In Proc. of the Fourth International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, pages 73-88, October 2005. Technical Documents The syntax of ESSENCE Version 1.1.0.. The syntax of MiniESSENCE, the subset of ESSENCE that is currently implemented. Talks Why ESSENCE? Frequently Asked Questions about a New Language for Specifying Combinatorial Problems. Delivered by Alan M Frisch at the Fifth International Workshop on Constraint Modelling and Reformulation, Nantes, France, September, 2006. CONJURE is a rule-based system that refines an ESSENCE Specification into a concrete constraint program that is similar to programs supported by existing constraint-solving toolkits.
The Rules of Constraint Modelling. By Alan M Frisch, Chris Jefferson, Bernadette Martinez Hernandez and Ian Miguel. In Proc. of the 19th International Joint Conference on Artificial Intelligence (IJCAI), 109-116, 2005. Other Papers on CONJURE A paper on CONJURE that we published in the 2004 Workshop on Modelling and Reformulating Constraint Satisfaction Problems. This paper is superseded by the one immediately above. Symmetry in the Generation of Constraint Models. By Alan M. Frisch, Chris Jefferson, Bernadette Martinez Hernandez and Ian Miguel. International Symmetry Conference, 2007. Talks on CONJURE A talk we have given on CONJURE. Symmetry and the Generation of Constraint Models. An invited talk given by Alan M Frisch at the Workshop on Automated Reasoning, August, 2005. Technical Documents
ESSENCE' is a subset of ESSENCE of the language that provides a level of abstraction comparable to that provided by existing constraint toolkits and languages. It is therefore a constraint modelling langauge rather than a problem specification language. ESSENCE' is basically ESSENCE with all the features for abstraction removed . We are currently developing a translator that maps ESSENCE' to Eclipse and another that maps ESSENCE' to Minion. We are currently writing a catalog of ESSENCE' specifications. Related Papers The Systematic Gernaration of Channelled Models in Constraints Satisfaction. By Bernadette Marinez Hernandez. PhD Dissertation, University of York, November, 2008. Representations in Constraint Programming. By Chris Jefferson. PhD Dissertation, University of York, June, 2007. Abstract of PhD Dissertation: Representations in Constraint Programming. By Chris Jefferson. June 2009. Small Sets of Ordering Constraints for some Families of Variable Symmetries. By Andy Grayland, Chris Jefferson, Ian Miguel and Colva Roney-Dougal. International Symmetry Conference, 2007. The Automatic Generation of Redundant Representations and Channelling Constraints. By Bernadette Martinez Hernandez and Alan M Frisch. In Proc. of the Fifth International Workshop on Constraint Modelling and Reformulation,, September, 2006. Representations of Sets and Multisets in Constraint Programming, By Christopher Jefferson and Alan. M. Frisch. Proc. of the Fourth International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, pages 102-116, October 2005. The Systematic Generation of Channelling Constraints. By Bernadette Martinez-Hernandez and Alan M. Frisch. Proc. of the Fourth International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, pages 89-101, October 2005. Transforming and Refining Abstract Constraint Specifications. By Alan M Frisch, Brahim Hnich, Ian Miguel, Barbara M. Smith and Toby Walsh. Proceedings of the 6th International Symposium on Abstraction, Reformulation and Approximation (SARA), LNAI 3607, 76-91, 2005. Generating Effective Constraint Programs: An Application of Automated Reasoning. By Alan M. Frisch, Chris Jefferson, Benadette Martinez-Hernandez and Ian Miguel. Proceedings of the 11th Workshop on Automated Reasoning, 2004. Symmetry-breaking as a Prelude to Implied Constraints: A Constraint Modelling Pattern By Alan M Frisch, Chris Jefferson and Ian Miguel. Proceedings of the 16th European Conference on Artifical Intelligence, pages 171-175, 2004. Department of Computer Science, University of York School of Computer Science, University of St. Andrews This web-page is maintained by Alan Frisch, and was last changed on 157 December 2006. |