Y. Kimura and T. Chikayama, "An Abstract KL1 Machine and Its Instruction Set," Proceedings of International Symposium on Logic Programming, pp.468-477, San Francisco, CA, IEEE Computer Society Press, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
CLPKIDS: A Program Analysis System for Concurrent Logic.. - Zhao, Cheng, Ushijima (2001) (Correct)
....debugging, maintenance and complexity measurement of concurrent logic programs. 1 Introduction Concurrent logic programming is a new field of concurrent programming, where logic programming, process oriented programming, and concurrent objectoriented programming all meet and fuse together [1, 5, 11, 13]. It is powerful so that many important programming paradigms such as object oriented programming and stream communication can be subsumed. For example, as one of the prominent features of concurrent logic programming languages, they allow us to describe interprocess communication with complicated ....
Y. Kimura and T. Chikayama, "An Abstract KL1 Machine and Its Instruction Set," Proceedings of International Symposium on Logic Programming, pp.468-477, San Francisco, CA, IEEE Computer Society Press, 1992.
A Lingua Franca for Concurrent Logic Programming - Hamish Taylor (1989) (Correct)
....of the local chain ends. mode alpha( alpha(A, D, X1, X2) alpha(A, D) X1 = X2. The design of KL1 B, the basic machine language for ICOT s parallel inference machine [15] has already been influenced by these considerations. KL1 B [10] is based upon Flat GHC but has been extended by pragmas and a meta call. The price is the loss of GHC s nice semantic properties. Tuesday, March 19, 9 Neither can GHC generally use its sequencing rule alpha(A, D, X1, X2) alpha(A, D) X1 = X2. to achieve the same effect, because the ....
Y. Kimura and T. Chikayama, "An abstract KL1 machine and its Instruction Set", TR-246, Inst. for New Gen. Comp. Technology, Tokyo, 1987. Tuesday, March 19, - 23 -
Reconciling Systems and Deductive Capabilities in Knowledge Based .. - Taylor (Correct)
....mechanisms of the parallel knowledge base sub system complement the rough fairness of multi tasking on the KL1 implementation, overall processing of concurrent knowledge based systems should preserve multi tasking fairness. Interactive task control will be ensured by the mechanisms of PIMOS [17]. By going for a dedicated knowledge base approach, the FGCS project is losing a lot of flexibility in programming querying over the knowledge base. The functionality of rbu 1 is hard wired, whereas the functionality of a Prolog computation invoked from a Parlog computation is open to a rich and ....
Y. Kimura and T. Chikayama, "An Abstract KL1 Machine and its Instruction Set," ICOT Technical Report TR-246, Institute for New Generation Computer Technology, Tokyo, Japan, (1987).
Potentiality of Parallelism in Logic - Kurfeß (1991) (Correct)
No context found.
Kimura, Y. and Chikayama, T. (1987). An Abstract KL1 Machine and its Instruction Set. Technical Report TR-246, Institute for New Generation Computer Technology (ICOT), Tokyo, Japan.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC