Representing calendrical algorithms and data in Prolog and Prolog III languages
Authors: P. Návrat and M. Bieliková
Reference: ACM SIGPLAN Notices, 30(7):45-51, July, 1995.
Contents:
- Introduction
- Method for calendrical calculations
- Prolog III Language
- Conversion to/from absolute date
- Conversion between calendars
- Incorporating other relevant data
- Conclusions
Abstract: The paper reports on a study to develop solutions for a chosen problem in two related, but different languages. Moreover, the languages reflect two related, but different programming paradigms: logic programing, and constraint logic programming, respectively. We use Prolog to describe calendars and their mutual conversions. Next, we use Prolog III to describe the same. We discuss suitability of both languages for this kind of task. Prolog III as a logic programming language with constraints allows writing a program which is both more general (i.e., covering a broader range of cases) and more abstract (i.e., expressed on a higher level of abstraction due to the use of constraints).
Keywords: Logic Programming, Constraints, Calendar, Prolog, Prolog III.
PS version (91K file, 7 pages) together with a PDF version (142K file) is available.
 |
to Homepage | |
to Publications |  |
to the Top |
|
 |
 |
 |
|
|
|
 |
|
|
|
 |
|
|
 |
 |
 |
|
 |
 |
|
|
|
 |
|
|
|
 |
|
|
|
 |
|
|
|
|
|
 |
|
|
|
|
|
|
|
|
|
 |
|
|
|
|
|
|
|
|
|
|