Under certain hypothesis a heuristic search can be considered as a random sampling process.Thus,it is possible to transfer the statistical inference method to the heuristic search.Based on the idea above,in [1—4]we have incorporated some specific statistical inference method into heuristic searches,and obtained some new statistical heuristic search algorithms——SA,WSA etc.The characteristics and the details of the algorithms have also been discussed. In this paper we go further into the subject and discuss t…

Inductive learning is an important subject in artificial intelligence.As a concern of theoretical computer science,this paper investigates the complexity of induction of structural descriptions which is fundamental to inductive learning.The general complexity is derived,and a way of approaching the induction,namely,computing the maximal common generalizations by pairing,is also presented with its inherent complexity. A group of NP-complete and NP-hard problems are introduced when showing the complexities.

Decision support systems have been shown to increase management s effectiveness and productivity in handling decision problems.This paper presents a general model of decision-making.Based on the model,a Knowledge-based Decision Support System(KDSS)will be proposed.The major emphasis is on using PROLOG to represent database query,model and module dependency.Problem description language is also described.

Preliminary RemarksBy Logic we mean the discipline which includes proof theory,model theory,recur-sion thoery and axiomatic set theory.In recent years there is a growing recognition of therelevance of logic to computer programming.The close relationship between these twofields seems to be aptly capsuled in the formula proposed by Patrick Hayes among others

Four classes of conceptual models are classified:pure static,dynamic,temporal and full time perspec- tive models.This paper presents a temporal framework fur specifying and verifying a conceptual model.A specification consists of static and temporal constraints,and operation descriptions.Consistency checking of the specification is described.A simple example is used to illustrate the features of the framework.

In this paper,we describe firstly a formal concept of stack and introduce some operational rules on it. Then we extend the denotational semantics to“the denotational semantics with stacks”,by which we make a formal semantics for a real PASCAL(subset)which can run on a computer.By an example of program with procedures it will be seen that our method can be used to describe the basic principles of compiling. Finally,we have succeeded in building a formal semantics model of a PROLOG(subset).

SDI is an interactive system,based on PASCAL,for Symbolic Differentiation and Integration compulation.It runs on an IBM-PC.Both input and output are symbolic mathematical expressions.It can manipulate symbolic differentiation,symbolic integration,and algebraic simplification,etc.The language and implementation of SDI will be presented in this paper.

Test Generation for large circuits may be extremely difficult.One of the approaches to alleviating this problem is to consider the difficulties during the design cycle.This paper proposes a design of Easy Test Generation Programmable Logic Arrays(ETG PLAs),for which test generation is basically not required,since a complete test set can be generated while the test is applied.This paper also presents a procedure which makes a PLA an ETG PLA by following some design rules and providing reasonable extra hardwa…