Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-17T22:28:35.004Z Has data issue: false hasContentIssue false
  • English
  • Français

Introduction to the special issue on Prolog systems

Published online by Cambridge University Press:  12 September 2011

BART DEMOEN  and
MARIA GARCIA DE LA BANDA
BART DEMOEN
Affiliation:
Department of Computer Science, K.U.Leuven, B-3001 Leuven, Belgium (e-mail: [email protected])
MARIA GARCIA DE LA BANDA
Affiliation:
Faculty of Information Technology, Monash University, Melbourne, VIC 3145, Australia (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Extract

It has now been 40 years since the birth of the Prolog language and of its first implementation by A. Colmerauer and P. Roussel. Since then, a large number of Prolog systems have been implemented. While the core of the Prolog language has not changed much in these 40 years, Prolog systems have undergone an extraordinary evolution that stems from two main sources. One is the trend to extend Prolog to incorporate ideas from other language paradigms that have proved useful in real-world applications. This includes concurrency, parallelism, higher order predicates, object-oriented programming, Web interfaces, processing of large amounts of data, and flexible developer tools that enhance reliability and robustness through assertions. A second source of change is the exploration of ideas for which Prolog systems are uniquely suitable and that have led to the creation of new programming paradigms. This includes tabling, constraint logic programming, answer set programming, and probabilistic logic programming.

Type
Introduction
Information
Theory and Practice of Logic Programming , Volume 12 , Special Issue 1-2: Prolog Systems , January 2012 , pp. 1 - 4
Copyright
Copyright © Cambridge University Press 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)