A semantics for parallel logic programs.

Title: A semantics for parallel logic programs.
Identifier: AAI9009770
identifier: 9009770
Creator: Piccarello, James.
Contributor: Adviser: Eralp Akkoyunlu
Date: 1989
Language: English
Publisher: City University of New York.
Subject: Computer Science
Abstract: Denotational semantics for logic programs have been developed by Apt, Van Emden, Kowalski, Fitting, Lassez, and Maher. These efforts provide a precise definition of what relations are computed by logic programs. They do not address in detail how these results are computed. This thesis provides such a semantics using the CSP algebra of processes, developed by Hoare.;A class of CSP search tree processes is investigated. Such processes may be used to represent all possible solution sequences. The effect of a control component can be seen as constraining such a process. This allows a separate specification of the control component of a logic program. This control component is itself specified by a Horn clause logic program. This is done by extending CSP to include Horn clause guards. A formal semantics using techniques developed by Fitting. Thus, a parallel logic program may be specified with two sets of Horn clauses, one describing the manipulations of user data and the other describing the search process to be used.
Type: dissertation
Source: PQT Legacy CUNY.xlsx
degree: Ph.D.