


Остановите войну!
for scientists:


default search action
11th ICLP 1994, Workshop W1: Process-Based Parallel Logic Programming
- Koenraad De Bosschere, Jean-Marie Jacquet, Antonio Brogi:
ICPL 1994 Workshop W1: Process-Based Parallel Logic Programming, Santa Margherita Ligure, Italy, June, 1994. 1994
Several process-based parallel logic programming languages (e.g., Delta-Prolog, CS-Prolog, Multi-Prolog and Shared-Prolog) have been proposed as an alternative to goal-based (and/or) parallel execution models for logic programs. The main features of these languages are explicit process creation and explicit communication based on channels or blackboards. The workshop is aimed at being a forum for discussing the various topics of process-based parallel LP, ranging from theory to practice.
Session 1
- Koenraad De Bosschere:
Process-Based Parallel Logic Programming: A Survey of the Basic Issues. 1-10 - Paolo Ciancarini, Mauro Gaspari:
Parallel Symbolic Computing with the Shared Dataspace Coordination Model. 11-37 - Jean-Marie Jacquet, Luís Monteiro:
Towards Resource Handling in Logic Programming: the PPL Framework and its Semantics. 38-53 - Hamish Taylor:
Design of a Resolution Multiprocessor for the Parallel Virtual Machine. 54-63
Session 2
- Vincenzo Ambriola, Giovanni A. Cignoni, Laura Semini:
A Proposal to Merge Object Orientation, Logic Programming, and Multiple Tuple Spaces. 64-69 - Szabolcs Ferenczi:
Search Tree Unification: Paradigm for Process-based Logic Programs. 70-74 - Ivan Futó:
The Real-Time Extension of CS-Prolog Professional. 75-82 - David Moffat:
A Poor Man's Co-ordination of Prolog: COPr. 83-87 - A. Lopes, José Félix Costa, Danilo Montesi:
Process Semantics for Resolution. ICLP Workshop: Process-Based Parallel Logic Programming 1994: 88-

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.