Title Details: | |
Constraint Logic Programming |
|
Authors: |
Sakellariou, Ilias Vasileiadis, Nikolaos Kefalas, Petros Stamatis, Dimosthenis |
Reviewer: |
Tsadiras, Athanasios |
Description: | |
Abstract: |
Constraint Logic Programming (CLP) is one of the most successful extensions of logic programming, with applications in numerous industrial problems, such as scheduling issues. The chapter briefly presents the definition of constraint satisfaction problems, as well as concepts like the application of constraints to variable domains. It explains how such problems are solved using constraint filtering algorithms and search techniques. Using a well-established constraint programming platform (ECLiPSe) and its libraries, many examples of combinatorial applications are demonstrated, such as scheduling and resource allocation, thereby showing the reader how logic programming serves as a suitable platform for developing such programs.
|
Type: |
Chapter |
Creation Date: | 2015 |
Item Details: | |
License: |
http://creativecommons.org/licenses/by-nc-sa/3.0/gr |
Handle | http://hdl.handle.net/11419/789 |
Bibliographic Reference: | Sakellariou, I., Vasileiadis, N., Kefalas, P., & Stamatis, D. (2015). Constraint Logic Programming [Chapter]. In Sakellariou, I., Vasileiadis, N., Kefalas, P., & Stamatis, D. 2015. Logic Programming Techniques [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/789 |
Language: |
Greek |
Consists of: |
1. Κώδικας Prolog Κεφαλαίου 12 |
Is Part of: |
Logic Programming Techniques |
Publication Origin: |
Kallipos, Open Academic Editions |