Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

AGP

2010

IEEE

2010

IEEE

Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently used in many commercial applications. Since the original proposal, it has developed enormously: many languages and systems are now available either as open source programs or as commercial systems. Also, CLP has been one of the technologies able to recruit researchers from other communities to the declarative programming cause. Current CLP engines include technologies and results developed in other communities, which themselves discovered logic as an invaluable tool to model and solve real-life problems. 1 The CLP Paradigm Constraint Logic Programming (CLP) [7] represents a successful attempt to merge the best features of logic programming (LP) and constraint solving. Constraint solving [127, 6, 56, 31] includes a variety of expressive modelling frameworks and eﬃcient solving tools for real-life problems that ...

Related Content

Added |
10 Jul 2010 |

Updated |
10 Jul 2010 |

Type |
Conference |

Year |
2010 |

Where |
AGP |

Authors |
Marco Gavanelli, Francesca Rossi |

Comments (0)