Composition in Hierarchical CLP
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Constraint Satisfaction. Pages 640-644.
Abstract
We propose a variant of the Hierarchical Constraint Logic Programming (HCLP) scheme of Borning, Wilson, and others. We consider compositionality and incrementality in Constraint Logic Programming, introduce HCLP, and present Wilson's proof that it is noncompositional. We define a scheme for composing together solutions to individual hierarchies and show that hierarchy composition can be expressed very simply using filtering functions over bags (multisets) ; we present some properties of these functions , and define and explain an alternative to bag intersection which is also used in our scheme. We present an example involving three strength levels and show that we can achieve a close approximation to the solutions produced by standard HCLP.
@inproceedings{ijcai1995p84,
title = {Composition in Hierarchical CLP},
author = {Jampel, Michael and Hunt, Sebastian},
booktitle = {Proceedings of the Fourteenth International Joint Conference on
Artificial Intelligence, {IJCAI-95}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Chris S. Mellish},
pages = {640--644},
year = {1995},
note = {Constraint Satisfaction},
url = {https://ijcai.org/proceedings/1995/84},
}
TY - CPAPER TI - Composition in Hierarchical CLP AU - Jampel, Michael AU - Hunt, Sebastian T2 - Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95 PB - International Joint Conferences on Artificial Intelligence PY - 1995 SP - 640 EP - 644 UR - https://ijcai.org/proceedings/1995/84 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
