Title Details: | |
Declarative Programming |
|
Authors: |
Sakellariou, Ilias Vasileiadis, Nikolaos Kefalas, Petros Stamatis, Dimosthenis |
Reviewer: |
Tsadiras, Athanasios |
Description: | |
Abstract: |
The chapter begins with the presentation of R. Kowalski’s now-famous “equation,” which captures the essence of declarative programming. It explains how languages in this category allow the programmer to simply describe the problem to be solved, so that its solution is automatically carried out by the corresponding execution mechanism. The representation of the problem must be unambiguous and possess sufficient expressive power to effectively capture all its aspects — a requirement fulfilled by first-order logic. The chapter provides simple examples that highlight this approach and serve as a starting point for the introduction to first-order logic that follows.
|
Type: |
Chapter |
Creation Date: | 2015 |
Item Details: | |
License: |
http://creativecommons.org/licenses/by-nc-sa/3.0/gr |
Handle | http://hdl.handle.net/11419/779 |
Bibliographic Reference: | Sakellariou, I., Vasileiadis, N., Kefalas, P., & Stamatis, D. (2015). Declarative 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/779 |
Language: |
Greek |
Is Part of: |
Logic Programming Techniques |
Publication Origin: |
Kallipos, Open Academic Editions |