| N. Tamura, K. Wada, H. Matsuda, Y. Kaneda and S. Maekawa. Sequential Prolog Machine PEK. In Proc. of the International Conference on Fifth Generation Computing Systems, 542-550, 1984. |
....to generate intermediate WAM code or native machine code. The resulting program directly manifests the control aspect of the logic program, blends searching, backtracking, unification and memory management together. On the other hand, interpreterbased architectures, such as PSI I[6] and PEK[7], implement logic inference procedure in firmware. These machines take a Prolog program (or in some internal form) as input, answer user s queries in the interpretation manner. The microprogrammed interpreters are similar to an earlier milestone Prolog implementation, the DEC 10 Prolog system. ....
N. Tamura, K. Wada, H. Matsuda, Y. Kaneda and S. Maekawa. Sequential Prolog Machine PEK. In Proc. of the International Conference on Fifth Generation Computing Systems, 542-550, 1984.
.... often have time complexities worse to their approach in worst case [16] There are also some parallel algorithms [8, 37, 41] but the sequential nature of unification has been shown [5, 41] Some unification strategies use special hardware (transputers, unification coprocessors, Prologmachines) [7, 12, 26]. Most connectionist approaches implement only parts of unification. Also, the well known approach of Ballard [1] belongs to this category. Those of Muller, Stolcke and Holldobler [10, 18, 31] implement unification for different purposes. Their approaches are based on symbolic strategies and ....
Y. Kaneda, N. Tamura, K. Wada, H. Matsuda, S. Kuo, and S. Maekawa. Sequential Prolog machine PEK. New Generation Computing, 4:51--66, 1986.
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