|
Burt A and Ringwood GA, 1988. “The Binding Conflict Problem in Concurrent Logic Languages” submitted IJPP |
|
Brachman RJ and Levesque HJ, 1984. “The Tractability of Subsumption in Frame-based Description Languages” In: Proc. National Conf on AI, pp 34–37 |
|
Carriero N and Gelerntner D, 1989. “Linda in Context” CACM32 pp 444–458 |
|
Clark KL and Gregory S, 1986. “Parlog: Parallel Programming in Logic” ACM TOPLAS8(1) pp 1–49 |
|
Dikstra EW, 1976. A Discipline of Programming, New York: Prentice Hall |
|
Fuchi K and Furukawa K, 1986. “The Role of Logic Programming in the Fifth Generation Computer Project, Proc. Third Int. Conf. on Logic Programming, July 14–18, 1986, London: Springer-Verlag, Lecture Notes in Computer Science, pp 1–24. |
|
Harel A and Pnueli A, 1985. “On the Development of Reactive Systems” In: Apt KR, ed., Logics and models of Concurrent Systems, New York: Springer Verlag |
|
Hirata M, 1985. “Self-description of Oc and its Applications” (in Japanese). Proc 2nd National Conference of Japan Society of Software Science and Technology, pp 153–156 |
|
Hoare CAR, 1985. Communicating Sequential Processes, New York: Prentice Hall |
|
Huntbach M, 1988. “Parlog as a Language for Artificial Intelligence” TR, Dept Computing, Imperial College |
|
Inmos Ltd, 1984. Occam Programming Manual, New York: Prentice Hall |
|
Lassez JL, Maher MJ and Marriott K, 1988. “Unification Revisited” In Foundations of Deductive Databases and Logic Programming, Palo Alto, Morgan Kaufmann |
|
Maher MJ, 1987. “Logic Semantics for a Class of Committed Choice Programs” In 4th Int. Conf. on Logic Programming,Cambridge Mass,MIT Press |
|
Ringwood GA, 1987a. “Pattern-Directed, Markovian, Linear Guarded, Definite Clause Resolution” submitted JLP but rejected after the unreasonably long time of 21 months. |
|
Ringwood GA, 1987b. “Predicates and Pixels” to be published New Generation Computing 7, 1989 |
|
Ringwood GA, 1988a. “Parlog 86 and the Dining Logicians” CACM31 pp 10–25 |
|
Ringwood GA, 1988b. “Meta Logic Machines: A Retrospective Rationale for the Japanese Fifth Generation” Knowledge Engineering Review3, 303–320 |
|
Robinson JA, 1965. “A Machine-oriented Logic Based on the Resolution Principle” JACM12 pp 23–41 |
|
Saraswat VA, 1986. “Problems with Concurrent Prolog” Tech Rep 86–100, Carnegie Mellon University |
|
Saraswat VA, 1987a. “The Concurrent Logic Programming Language CP: Definition and Operational Semantics” Proc. of SIGACT-SIGPLAN Symposium on Principles of Programming Languages, New York, ACM, pp. 49–63 |
|
Saraswat VA, 1987b. “Merging Many Streams Efficiently: The importance of atomic commitment” In Concurrent Prolog: Collected Papers, MIT, vol. 1, pp. 421–445 |
|
Saraswat VA, 1987c. “GHC: Operational Semantics, Problems and Relationship with CP” In IEEE Int. Symp. on Logic Programming, San Francisco, pp. 347–358. |
|
Saraswat VA, 1989. “Concurrent Constraint Programming Languages” PhD thesis, Carnegie-Mellon University |
|
Shapiro EY, 1986. “Concurrent Prolog: a Progress Report” IEEE Computer, pp 44–58 |
|
Shapiro EY (ed.), 1987. Concurrent Prolog: Collected Papers, 2 vols, Cambridge Mass, MIT Press |
|
Shapiro EY, 1988. “A Survey of Concurrent Logic Programming Languages”, Weizmann Inst., Israel, in preparation |
|
Taylor S, 1988. PhD Thesis, Weizmann Inst., Israel |
|
Ueda K, 1986. “Guarded Horn Clauses” DEng thesis, University of Tokyo |
|
Yang R and Aiso H, 1986. “P-Prolog, a Parallel Logic Language Based on Exclusive Relation” In Proc. of 3rd Int Logic Prog. Conf. (London, July) New York:Springer-Verlag, pp 255–269 |
|
Warren DHD, 1987. “OR-parallel Execution Models of Prolog” In Tapsoft 87, LNCS250, New York: Springer-Verlag |