6,514 Result(s)
within
**ya Lu
Artificial Intelligence
-
Chapter and Conference Paper
A Knowledge-Based Expert System for Drilling Station Design
This paper presents the system architecture and preliminary implementation of an Intelligent DRILLing station design expert system (IDRILL). The entire design process is modeled as five sequential subgoals wit...
-
Article
Marking fairness in Petri nets
We study fairness with respect to markings in Petri nets, which means no infinite execution sequence such that in the sequence some marking occurs only finitely often but it is an element of the forward set of...
-
Article
A high resolution Chinese character generator
Font storage requirement is a crucial problem in develo** Chinese typesetting system. A unique data compression technique is adopted in the system. The representation of regular strokes and irregular strokes...
-
Article
Solution of the matrix equation AX−XB=C
In this paper a finite algebraic formula for the solution of the matrix equationAX−XB=C is derived. Based on it, a new direct algorithm is given.
-
Article
On the complexity of induction of structural descriptions
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 fund...
-
Article
Two algorithms for variable allocation in an Interpreted Scheme
The Interpreted Scheme (I. S. in short) is a concurrent system model based on a class of Petri nets. It can also be used for the specification of concurrent computations[4]. To avoid impractical shared variables ...
-
Article
Termination preserving problem in the transformation of applicative programs
Program transformation is a promising area of software methodology. The Folding/Unfolding method proposed by Burstall/Darlington is a simple and powerful transformation method for applicative programs. The onl...
-
Article
Program slicing: Its improved algorithm and application in verification
Program slicing is a method for automatical program decomposition. This paper presents an improved slicing algorithm on the basis of static analysis of the control structure of loop statements. The slice obtai...
-
Chapter and Conference Paper
A Simulation System for Flexible Manufacturing Cells
Based on the Local Area Network concept, four sets of IBM-PC are used to form a simulation system for a flexible manufacturing cell, which consists of a milling machine, a turning machine, an industrial robot ...
-
Chapter and Conference Paper
Synthesis of attributed hypergraphs for knowledge representation of 3-D objects
This paper continues our work on knowledge representation of 3-D objects. For recognition and location of 3-D objects, Attributed Hypergraph Representation has been introduced. The new research concentrates on...
-
Chapter and Conference Paper
Fractal curve and attribute grammar
-
Article
Geometric modelling by recursively cutting vertices
In this paper, a new method for curve and surface modelling is introduced which generates curves and surfaces by recursively cutting and grinding polygons and polyhedra. It is a generalization of the existing ...
-
Article
Enhance the automatic acquisition of knowledge
The first part of this paper gives a short review of the research work done in the field of knowledge acquisition. The second and third parts describe two sets of tools for knowledge, which are designed and im...
-
Chapter
The Design of a Logic Query Processor
We present the design of a logic query processor for linear recursive rules. Unlike the traditional methods which primarily use query information in query processing, our design makes use of both query informa...
-
Chapter and Conference Paper
Automatic theorem proving in paraconsistent logics: Theory and implementation
Databases and knowledge bases may be inconsistent in many ways. However, a database that is inconsistent may, nonetheless, contain a great deal of useful information. Classical logic, however, would deem such ...
-
Article
Protected completions of first-order general logic programs
Minker and Perlis [15] have made the important observation that in certain circumstances, it might be desirable to prevent the inference of ⌝A when A is in the finite failure set of a logic program P. In this pap...
-
Article
Construction of the model of the lambda calculus system with algebraic operators
A lambda system with algebraic operators, lambda-plus system, is introduced. After giving the definitions of the system, we present a sufficient condition for formulating a model of the system. Finally, a mode...
-
Chapter and Conference Paper
Insights into cooperative group design: Experience with the LAN designer system
Our experience with implementing the LAN Designer system for cooperative group design of local area networks has led to a number of insights into how cooperative group design systems can be structured to effec...
-
Chapter and Conference Paper
Efficient access methods in deductive and object-oriented databases
Recently, a new access method, the Hierarchical-Tree (H-tree) was proposed as an efficient access method for object-oriented database that supports superclass-subclass relationship. We show that, the H-tree in...
-
Chapter
Reasoning in Paraconsistent Logics
Databases and knowledge bases could be inconsistent in many ways. For example, if a programmer is constructing an expert system ES relating to a domain D,he does so by consulting several experts (say n in number)...
