H ? « »

Language peer sets for CS-Prolog:
Designed 1986
1980s languages
Fifth generation
Late Cold War
Genus Horn clause
String and List Processing
Horn clause
Data representation
Horn clause/1986
Context-based /1986
Data representation/1986
Horn clause/Hungary
Context-based /Hungary
Data representation/Hungary
String and List Processing
String and List Processing/1986
String and List Processing/hu


alternate simple view
Country: Hungary
Designed 1986
Genus: Horn clause
Sammet category: String and List Processing

from documentation:

"CS-Prolog Interpreter
The CS-Prolog interpreter was developed by Multilogic Ltd between 1986 and 1989. The aim of the project was to extend the capabilities of the Prolog language by adding simulation support and concurrency to the system. The new concepts introduced to CS-Prolog were process, message passing and discrete simulation time.

We can create a new process in CS-Prolog with a specific goal - a Prolog expression - and an execution time limit. Processes communicate with each other by means of message passing. The execution time of a Prolog expression can be limited to a time interval. The system will step back as soon as it detects a deadlock - a situation where every process is waiting for a message from another process.

The CS-Prolog interpreter works on single-processor machines (DOS) and on transputers. The system uses the next-event algorithm to run processes that are generated on the same execution unit. This means that the active process can run as long as it is not waiting for a message and is not adjusting time. After suspending one process the system will select the next executable process in the closest simulation time (and not in the real time).

CS-Prolog has a complete execution algorithm which means that the system will always find a solution provided that it exists. For this reason backtracking has a global scope, that is, if one process steps back than all other process must step back as well. In the multi-processor systems this task is handled by a refined distributed backtracking algorithm.

The DOS version of the CS-Prolog interpreter contains extensions for continuous simulation. It is possible to define continuous processes - whose behaviour is controlled by a differential equation system. As simulation time progresses the interpreter will calculate the solutions of the differential formulae which in turn are used by the other (discrete) processes."

Related languages
Marseille Prolog CS-Prolog   Based on
CS-Prolog CS-Prolog II   Evolution of

  • I. Futo et al, (1989) I. Futo et al, "CS-Prolog on Multi-Transputer Systems", Microprocessors & Microsystems, March 1989.
    Search in: Google  Google scholar  World Cat  Yahoo  Overture  DBLP  Monash bib  NZ  IEEE  ACM portal  CiteSeer  CSB  ncstrl  jstor  Bookfinder