700 search results - page 36 / 140 » On Termination of Constraint Logic Programs |
121
click to vote
PEPM
2010
ACM
15 years 1 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
CP
2000
Springer
15 years 3 months ago
2000
Springer
Constraint programming offers a variety of modeling objects such as logical and global constraints, that lead to concise and clear models for expressing combinatorial optimization...
ENTCS
2007
14 years 11 months ago
2007
Programs in modern functional logic languages are rewrite systems following the constructor discipline but where confluence and termination are not required, thus defining possi...
106
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
106
click to vote
CORR
2002
Springer
14 years 11 months ago
2002
Springer
Program specialisation aims at improving the overall performance of programs by performing source to source transformations. A common approach within functional and logic programm...