Michael Jampel and Sebastian Hunt. Composition in Hierarchical CLP. In IJCAI'95, Montreal, August 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....ordered constraint hierarchy to be the union of solutions from all totally ordered hierarchies that are consistent with the partially ordered one. Wilson and Borning [16] adopt the constraint hierarchy theory to extend the CLP scheme [8] for non required constraint processing. Jampel and Hunt [10] propose a weakening of the HCLP semantics, in which the incrementality and compositionality properties are preserved. Govindarajan et al. [6] propose preference logic programming (PLP) another extension of CLP, for declaratively specifying problems requiring optimization or selection among ....

M. Jampel and S. Hunt. Composition in hierarchical CLP. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 640--645, 1995.

....of CLP. We believe that these two issues may be related, and suggest that splitting HCLP into two parts, one of which has a clean compositional semantics, and the second which introduces the non monotonicity necessary to mimic HCLP, may overcome both these issues. Our earlier work in this area [ 7 ] did not include the idea of splitting HCLP into two schemes, which we now feel was a limiting factor. We propose a decomposition of the semantics of HCLP into two parts, which we call BCH (Bags for the Composition of Hierarchies) and FGH (Filters, Guards, Hierarchies) BCH is compositional and ....

Michael Jampel and Sebastian Hunt. Composition in Hierarchical CLP. In IJCAI'95, Montreal, August 1995.

....and suggest that splitting HCLP into two parts, one of which has a clean compositional semantics, and the second which introduces the non monotonicity necessary to mimic HCLP, may overcome both these issues. Our earlier work in this area did not include the idea of splitting HCLP into two schemes [7], which we now feel was a limiting factor. Therefore we propose a decomposition of the semantics of HCLP into two parts, which we call BCH and FGH. BCH is compositional and so is amenable to efficient implementation. It composes individual hierarchies together, giving a superset (in fact, ....

Michael Jampel and Sebastian Hunt. Composition in Hierarchical CLP. In IJCAI'95, Montreal, August 1995. (Accepted).

....to be the best possibility; it may not be ignored in favour of one of its relaxations. Compositionality is very important in CLP, both for theoretical reasons and due to its relationship with incrementality of implementations. This is discussed in much greater detail in some of our earlier papers [10, 9], and also in [11] Gocs is as compositional as it is possible for a system to be when it includes preferences and partiality; it is a fundamental feature of this class of theories that the best solution (or the best consistent subproblem) of an over constrained problem P , when combined with ....

....as there is a standard proof in the theory of HCLP that it is disorderly [14] which is a non monotonicity result and hence generally taken as showing that HCLP is non compositional. In previous work, we have constructed a variant of HCLP with two parts, the first of which is compositional [10]. The second part of that work is equivalent to selecting the best element of the order, and re introduces non compositionality; the results of that work are placed in a broader context by this paper. 5.2 PCSP in Gocs Unlike HCLP, PCSP does not have strength labels. Also, it does not distinguish a ....

[Article contains additional citation context not shown here]

Michael Jampel and Sebastian Hunt. Composition in Hierarchical CLP. In IJCAI'95, Montreal, August 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC