EasyChair Publications
Search
Paper Information
Paper:Steve Prestwich, S. Armagan Tarim and Roberto Rossi
Constraint Problem Specification as Compression
Title:Constraint Problem Specification as Compression
Authors:Steve Prestwich, S. Armagan Tarim and Roberto Rossi
Keyphrases:constraint programming, constraint logic programming, specification language
Paper:
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.
Volume:Christoph Benzmüller, Geoff Sutcliffe and Raul Rojas (editors). GCAI 2016. 2nd Global Conference on Artificial Intelligence
Series:EPiC Series in Computing
Volume number:41
Pages:280-292
Editors:Christoph Benzmüller, Geoff Sutcliffe and Raul Rojas
BibTeX entry:
@inproceedings{GCAI2016:Constraint_Problem_Specification_as_Compression,
  author    = {Steve Prestwich and S. Armagan Tarim and Roberto Rossi},
  title     = {Constraint Problem Specification as Compression},
  booktitle = {GCAI 2016. 2nd Global Conference on Artificial Intelligence},
  editor    = {Christoph Benzm\verb=\="uller and Geoff Sutcliffe and Raul Rojas},
  series    = {EPiC Series in Computing},
  volume    = {41},
  pages     = {280-292},
  year      = {2016},
  publisher = {EasyChair},
  bibsource = {EasyChair, http://www.easychair.org},
  issn      = {2398-7340}}