35378923
Motor Skill as Dynamic Constraint Satisfaction
10275573
The role of logic programming in the Fifth Generation Computer Project
This paper describes the role of logic programming in the Fifth Generation Computer Project. We started the project with the conjecture that logic programming is the “bridge” connecting knowledge information processing and parallel computer architecture. Four years have passed since we started the project, and now we can say that this conjecture has been substantially confirmed. The paper gives an overview of the developments which have reinforced this foundational conjecture and how our “bridge” is being realized.
2374698
A Model of Children's Vocabulary Acquisition Using Inductive Logic Programming
2293804
GHC - A Language for a New Age of Parallel Programming
A parallel logic programming language GHC, proposed by Ueda (1985), is now playing a very important role in the Fifth Generation Computer Project. It is a successor of Relational Language (Clark and Gregory 1981), Concurrent Prolog (Shapiro 1983) and Parlog (Clark and Gregory 1984). Since GHC is totally based on parallelism, it provides a genuine tool for parallel programming. It encourages programmers to write parallel algorithms and therefore gives a foundation of parallel programming. We have also developed a program transformation technique for GHC programs which preserves the external behaviour of the original programs. To show the validity of the transformation technique, we have developed a formal semantics of possibly non-terminating GHC programs. The highly parallel prototype hardware of our project is now being developed to support the efficient execution of GHC programs.
30844306
Specification Languages versus Programming Languages (Panel)
34444111
Modularization and abstraction in logic programming
In knowledge information processing, the structuring of knowledge and algorithms is one of the key issues. The goal of this work is to introduce the concepts and mechanisms of abstraction, modularization and parameterization into logic programming, which is one of the preliminary steps toward creating a kernel language for fifth generation computer systems.
11394601
On the number of securities which constitute an efficient portfolio
The purpose of this paper is to discuss the relationship between the number of securities which constitute an efficient portfolio as defined by the standard mean-variance portfolio selection model and the number of periods used to compute the efficient portfolio. It is shown that the number of data gives the upper bound of the number of securities which constitute an efficient portfolio, when each efficient portfolio is unique for a given expected return. Empirical tests based on actual return data show that this upper bound is very tight when the number of data is small. However, when more data are used, the upper bound becomes looser. This result is incompatible with the market efficiency. These empirical tests also indicate that a very tight upper bound often causes a degenerate case ensuring zero-variance portfolios.