Abstract:In this paper, a new type of multiway height balance trees-Compact (a, b) tree is presented. In such a tree, the nearly optimal storage utilization and nearly optimal height are guaranted by intruducing a constrain between number of children and gradchildren with a Reorganize operation. It s seach opertion is quicker than the B*-trees and B-trees. It s update operations (insert, delete) are the same performance as B-trees on the amortized computational complexity.

Abstract:This paper introduces an English automatic abstract system EAAS, describes its architecture, internal representations, algorithms and background knowledge.

Abstract:PARLOG relations are divided into two types: single-solution relations and all-solution relations. A sequential compiling technique for PARLOG single-solution relations, which based on and/or tree model and process-scheduling strategy, is introduced in this paper.

Abstract:INCAPS (INteractive Computer-Aided Proving System) is a proof system of temporal logic. This paper outlines its proof strategies (tactics, tacticals) variety and structure. The kernel of it is to discuss the validity of tactics and tacticals. After introducing several new concepts: proof strategies level number, function tree and B function defined on it, we show that INCAPS proof strategies are valid.

Abstract:In a traditional approach to operational semantics of recursive programs, ω was introduced as an undefined value and then flat partial orders, ω-extensions, transition relation, computation sequences etc. were defined based on a nonstandard interpretation. The aim of this paper is to avoid introducing ω. Instead we introduce directly the syntax and operational semantics of recursive programs based on a basis for predicate logic and its standard interpretation. Hence we refute the claim of Loeckx and Sieber that no operational semntics of recursive programs can build upon predicate logic.

Abstract:Efficiently organizing and retrieving software component is the key to software reuse technique. The paper introduces an information retrieval system for supporting software reuse-KDZ. The system bases on the formal description of software component, and takes the reusability theory as the rule of verification. By the Combination of term-rewriting and retrieving technique, the KDZ system has the function of semantics verification.

Abstract:This paper presents a module silicon compilation expert system--SCES developed by us. SCES consists of a set of cooperating expert systems with common blackboard structures and is featured by performing topological modification, using widespreadly deducing CAD database (dCADB), logical reduces, rule_based programming and an open inference schedule system. SCES takes specifications (chip dimension rate, cell delays and pad arrangements) from input file, performs topological modifications, logical and layout automatic design,sets up dCABs of design results,outputs the logic drawing,layout and circuit SPICE format file including parasitic parameters of interconnections.

Abstract:KBE-Pascal is an interactive programming assistant system. The intention is that the programmer will do the hard parts of design and implementation while the KBE-Pascal will assist him wherever possible. The major underpinning of KBE-Pascal is plan, a kind of representation for programs, which abstracts away from the inessential features of a program and represents the basic logical properties of the algorithm explicitly. The main design goal of KBE-Pascai is rapidly and accurately building up a program by refering to the fragments in the plan library.It's object language is Pascal.The current system is composed of four parts:a coder that can creste program text corresponding to a plan;a library of plans for common algorithm fragments;a plan editor which makes it possible for a programmer to modify a program by modifying its plan;and a text editor which makes it possible for a programmer to edit on program text directly.

Abstract:The conceptually oriented design knowledge acquisition system described in this paper is a very general knowledge acquisition environment which understands basic logic and language. The system contains ideas from artificial intellegence (ai), object-oriented programming (oop) and logic programming (Ip). Knowledge is organized into small unit termed conceptual Descriptors (cds) in the system which are analogous to frames in ai or objects in oop. Cds are defined by a number of properties such as attributes, logic constraints and functional equations,and arranged in inheritance hierarchies.There are some semntic subsystems such as afirst order logic subsystem and simple natural language subsystem which are used to perform various types of semantic checks and debug logically redundancy,contradication and non-consistence about knowledge.The system is intended to assist in the process of developing descriptions,definitions,or specifications of system under design,or ti describe existing system for documentation or teaching purposes.Typical applications would include most kinds of expert system and software system.