Abstract:This paper describes the prototype sharing thought in GOAM- a new abstract machine for Prolog. When backtracking, using prototype sharing technique can reduce the quantities of memory consumed by Prolog system efficiently, this helps to solve the particular problem-"stack overflow" in Prolog system.

Abstract:This paper presents a theory and a computational model of analogical match, and an implementation of this model, named AME. The theory includes consistency, predicate similarity and support principles. Because the computational model constructs mapping in proposition-oriented match, and takes proposition mapping as primitive units, the complexity of AME is lower than the same kind of system. The paper also proves the implementation algorithms to be complete and reasonable.

Abstract:A formal model of the Eiffel(1988) programming language is described using the denotational style. The model defines Eiffel's object model and two environments (dynamic and static) at first, and then studies semantics of Eiffel's routines. The "exit" mechanism of VDM is used for processing Eiffel's exception.

Abstract:Presently, it's more urgent to develop the integrated CAD system that the database is the kernel. In order to support this integration, many jobs need to be done, and all of them, it's a very important means to provide a convenient developing environment which can generate interface bet-ween database and applications automatically. In this thesis, they analyzed the general function and structure of this kind of interface, and then, put forward a general model of interface developing environment between database and applications, which based on software reusable method-DDBUIS. Combining the two reusable methods, DDBUIS attempts to generate the interface between database and applications automatically, and also provides reusable supporting for software developers during developing other systems.

Abstract:This paper describes TML, a metalanguage intended for proof development and program design environments. The abstract theory and meta-module mechanisms are presented in TML to allow a good modularization of proof development and make it possible to direct the search for a proof in well-structured theories mechanically.

Abstract:In this paper, both a sequential and an asynchronised algorithm to compute the all pair shortest distance matrix D and the path matrix P are given. This result is applied to develop other asynchronized graph algorithms. The main steps to code these asynchronised algorithms in ADA are introduced.

Abstract:This paper introduces the causal relations between events among communicating and cooperating processes in distributed systems. Based on the viewpoint that more than one task may progress among a group of cooperating processes and the tasks may not relate with each other, the authors propose the concept of event class. Furthermore, they propose a causal ordering guaranteeing algorithm using the event class concept.

Abstract:A theory about object and object-abstract is proposed, and the rule-order and rule - mapping formalism is presented, and so, laid a certain foundation for object analogical reasoning. Based on the proposed theories, an analogical reasoning model OAM is established.

Abstract:In this paper, a method of fuzzy knowledge representation using partial quantifies and fuzzy predicates is proposed, a data-abstraction method of discovering knowledge from relational databases is briefly introduced followed by a presentation of an approach to deal with fuzziness in discovering.

Abstract:This paper describes how to set up collocation dictionaries to express the indi-vidual language phenomena and processing rules，which are important complementary knowledge bases for basic dictionaries and general rule bases．In order to fit for the combi nation of the randomness and regularity in natural languages，the paper proposes the lexi-cal semantic driving algorithm with an example in Chinese analyzing，which can solve the difficult problems such as polysemantic processing in natural language processing．