Transforming and refining abstract constraint specifications

Authors:
Alan M. Frisch;Brahim Hnich;Ian Miguel;Barbara M. Smith;Toby Walsh
Affiliations:
Dept. of Computer Science, University of York, UK;Cork Constraint Computation Centre, University College Cork, Ireland;School of Computer Science, University of St Andrews, UK;Cork Constraint Computation Centre, University College Cork, Ireland;National ICT Australia and Dept. of CS & E, UNSW, Australia
Venue:
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Year:
2005

Citing 11
Cited 2

A theory of abstraction

Artificial Intelligence
A Context for Constraint Satisfaction Problem Formulation Selection

Constraints
Compiling Problem Specifications into SAT

ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
NP-SPEC: An Executable Specification Language for Solving All Problems in NP

PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
Global Constraints for Lexicographic Orderings

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Breaking Row and Column Symmetries in Matrix Models

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Improving Discrete Model Representations via Symmetry Considerations

Management Science
Dual modelling of permutation and injection problems

Journal of Artificial Intelligence Research
The rules of constraint modelling

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
CGRASS: a system for transforming constraint satisfaction problems

ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Symmetry and search in a network design problem

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Essence: A constraint language for specifying combinatorial problems

Constraints
The design of ESSENCE: a constraint language for specifying combinatorial problems

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

To use constraint technology to solve a problem, the solutions to the problem must first be characterised, or modelled, by a set of constraints that they must satisfy. A significant part of the modelling process can be characterised as refinement, the process of generating a concrete model from an abstract specification of the problem. Expert modellers also identify and perform transformations that can dramatically reduce the effort needed to solve the problem by systematic search. Through a case study of modelling a simplified version of the SONET fibre-optic communication problem, this paper examines the processes of refinement and transformation, and especially the interaction between the two.