Constraint Problem Specification as Compression
Publication Type:
Refereed Conference Meeting Proceeding
Abstract:
Constraint Programming is a powerful and expressive framework for
modelling and solving combinatorial problems. It is nevertheless not
always easy to use, which has led to the development of high-level
specification languages. We show that Constraint Logic Programming
can be used as a meta-language to describe itself more compactly at a
higher level of abstraction. This can produce problem descriptions of
comparable size to those in existing specification languages, via
techniques similar to those used in data compression. An advantage
over existing specification languages is that, for a problem whose
specification requires the solution of an auxiliary problem, a single
specification can unify the two problems. Moreover, using a symbolic
representation of domain values leads to a natural way of modelling
channelling constraints.
Conference Name:
2nd Global Conference on Artificial Intelligence (GCAI 2016)
Digital Object Identifer (DOI):
10.29007/7ths
Publication Date:
01/10/2016
Volume:
41
Pages:
280-292
Conference Location:
Germany
Research Group:
Institution:
National University of Ireland, Cork (UCC)
Project Acknowledges:
Open access repository:
No
Publication document: