Compilation for QCSP
Programming Languages
2013-07-18 v1
Abstract
We propose in this article a framework for compilation of quantified constraint satisfaction problems (QCSP). We establish the semantics of this formalism by an interpretation to a QCSP. We specify an algorithm to compile a QCSP embedded into a search algorithm and based on the inductive semantics of QCSP. We introduce an optimality property and demonstrate the optimality of the interpretation of the compiled QCSP.
Keywords
Cite
@article{arxiv.1307.4655,
title = {Compilation for QCSP},
author = {Igor Stéphan},
journal= {arXiv preprint arXiv:1307.4655},
year = {2013}
}
Comments
Proceedings of the 13th International Colloquium on Implementation of Constraint LOgic Programming Systems (CICLOPS 2013), Istanbul, Turkey, August 25, 2013