## On Proving Left Termination of Constraint Logic Programs (2001)

Venue: | ACM Transaction on Computational Logic |

Citations: | 17 - 7 self |

### BibTeX

@ARTICLE{Mesnard01onproving,

author = {Fred Mesnard and Salvatore Ruggieri},

title = {On Proving Left Termination of Constraint Logic Programs},

journal = {ACM Transaction on Computational Logic},

year = {2001},

volume = {4},

pages = {207--259}

}

### Years of Citing Articles

### OpenURL

### Abstract

The Constraint Logic Programming (CLP) Scheme merges logic programming with constraint solving over predefined domains. In this paper, we study proof methods for universal left termination of constraint logic programs. We provide a sound and complete characterization of left termination for ideal CLP languages which generalizes acceptability of logic programs. The characterization is then refined to the notion of partial acceptability, which is well-suited for automatic modular inference. We describe a theoretical framework for automation of the approach, which is implemented. For non-ideal CLP languages and without any assumption on their incomplete constraint solvers, even the most basic sound termination criterion from logic programming does not lift. We focus on a specific system, namely CLP(R), by proposing some additional conditions that make (partial) acceptability sound