![]() Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading Massachusetts, (1979). Thesis, Imperial College, London, (1985). Gregory, Design, Application and Implementation of a Parallel Logic Programming Language, Ph. Kusalik, Process Serialization in a Concurrent Prolog, New Generation Computing 2(3): 289–298 (1984). Hopkins, Data-Driven and Demand-Driven Computer Architecture, Computing Surveys 14(1): 93–143 (March 1982).Ī. Saraswat, Problems with Concurrent Prolog, CMU Technical Report, (June 1985). Ueda, Concurrent Prolog Re-examined, TR-102, ICOT, Japan, (1984). Gregory, A Relational Programming Language for Parallel Programming, Research Report, Imperial College, (July 1981). de Lucena, Predicate Logic as a Programming Language for Parallel Programming, in Logic Programming, K. of the First Workshop on Logic Programming, pp. Morris, A Dataflow Interpreter for Logic Programs, Proc. Mark, Giuliano, Madhur Kohli, Jack Minker, Arcot Rajasekar, and Deepak Sherlekar, Parallel Logic Programming in PRISM: Initial Experimental Work, Technical Report, Department of Computer Science, University of Maryland, College Park, (1985). on Artificial Intelligence, (August 1983). Minker, Control Facilities of PRISM-A Parallel Inference System Based on Logic, Proc. McCabe, IC-Prolog Language Features, in Logic Programming, K. Ueda, Guarded Horn Clauses, TR-103, ICOT, Japan, (1985). on LISP and Functional Programming, Pittsburgh, (August 1982). Wise A Parallel Prolog: The Construction of A Data Driven Model, ACM Symp. Gregory, PARLOG: Parallel Programming in Logic, ACM TOPLAS 8(1) (January 1986). Shapiro, A Subset of Concurrent Prolog and Its Interpreter, TR-003, ICOT, (1983). of IJCAI-81, Vancouver (also University of Maryland CS TR-1028), (August 1981).Į. Bane, ZMOB: A New Computing Engine for AI, Proc. Minker, PRISM-A Parallel Inference System Based on Logic, Technical Report TR-1243, Computer Science Department, University of Maryland, (February 1983).Ĭ. Kasif, A Note on Translating Flowchart and Recursive Schemas to Prolog Schemas, TR-1273, Department of Computer Science, University of Maryland, College Park, Maryland, (May 1983). Kowalski, Logic for Problem Solving, North-Holland, (1979). Thesis, Computer Science Dept., University of Maryland., (1984). Kasif, Analysis of Parallelism in Logic Programs, Ph.D. Finally, we introduce a data structure that supports an efficient implementation of PRISM nested control flow. The idea is to convert the control/data dependencies into simple event scripts and then use existing methods to implement these scripts efficiently. Subsequently, we propose a simple low level language to implement both PRISM nested control flow and Concurrent Prolog read-only variables. Since control flow primitives are shown to have a simple and efficient implementation it seems that both data-flow and control-flow mechanisms are desirable for a general purpose parallel logic programming language. Although in many specific cases we may be able to write very natural specifications based on read-only variable and commit constructs, in general it is difficult to simulate control flow naturally using a transformation based on these constructs. Given a PRISM program we present several automatic transformations for deriving a Concurrent Prolog program whose execution is isomorphic to the original program. data driven execution of Concurrent Prolog. Specifically, we compare control driven execution of PRISM programs vs. In this paper we examine two methods for controlling the execution of parallel logic programs.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |