Representing calendrical algorithms and data in Prolog and Prolog III languages

Authors:
Pavol Návrat;Maria Bieliková
Affiliations:
Slovak Technical University, Dept. of Compuler Science and Engineering, Ilcovigova 3, 812 19 Bratislava, Slovakia;Slovak Technical University, Dept. of Compuler Science and Engineering, Ilcovigova 3, 812 19 Bratislava, Slovakia
Venue:
ACM SIGPLAN Notices
Year:
1995

Citing 4
Cited 0

Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Calendrical calculations, II: three historical calendars

Software—Practice & Experience
Logical objects with constraints

ACM SIGPLAN Notices
On the proof of correctness of a calendar program

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

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 programming, 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).