### Abstract

Original language | English |
---|---|

Book series | Lecture Notes in Computer Science |

Issue number | 2664 |

Pages (from-to) | 90-108 |

Number of pages | 19 |

ISSN | 0302-9743 |

Publication status | Published - 2003 |

### Cite this

*Lecture Notes in Computer Science*, (2664), 90-108.

}

*Lecture Notes in Computer Science*, no. 2664, pp. 90-108.

**Convex Hull Abstraction in Specialisation of CLP Programs.** / Peralta, J.C.; Gallagher, John Patrick.

Research output: Contribution to journal › Journal article › Research › peer-review

TY - JOUR

T1 - Convex Hull Abstraction in Specialisation of CLP Programs

AU - Peralta, J.C.

AU - Gallagher, John Patrick

PY - 2003

Y1 - 2003

N2 - We introduce an abstract domain consisting of atomic formulas constrained by linear arithmetic constraints (or convex hulls). This domain is used in an algorithm for specialization of constraint logic programs. The algorithm incorporates in a single phase both top-down goal directed propagation and bottom-up answer propagation, and uses a widening on the convex hull domain to ensure termination. We give examples to show the precision gained by this approach over other methods in the literature for specializing constraint logic programs. The specialization method can also be used for ordinary logic programs containing arithmetic, as well as constraint logic programs. Assignments, inequalities and equalities with arithmetic expressions can be interpreted as constraints during specialization, thus increasing the amount of specialization that can be achieved.

AB - We introduce an abstract domain consisting of atomic formulas constrained by linear arithmetic constraints (or convex hulls). This domain is used in an algorithm for specialization of constraint logic programs. The algorithm incorporates in a single phase both top-down goal directed propagation and bottom-up answer propagation, and uses a widening on the convex hull domain to ensure termination. We give examples to show the precision gained by this approach over other methods in the literature for specializing constraint logic programs. The specialization method can also be used for ordinary logic programs containing arithmetic, as well as constraint logic programs. Assignments, inequalities and equalities with arithmetic expressions can be interpreted as constraints during specialization, thus increasing the amount of specialization that can be achieved.

M3 - Journal article

SP - 90

EP - 108

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

IS - 2664

ER -