作者:
KIM, DHCHOE, KMProgramming Languages Laboratory
Department of Computer Science Korea Advanced Institute of Science and Technology 371-1 Kusong-Dong Yusang-Gu Taejon 305-701 South Korea
An efficient backward execution algorithm in the AND/OR Process Model for parallel evaluation of logic programs is proposed. The efficiency of the algorithm is achieved by means of information acquired during executio...
详细信息
An efficient backward execution algorithm in the AND/OR Process Model for parallel evaluation of logic programs is proposed. The efficiency of the algorithm is achieved by means of information acquired during execution of clauses. The algorithm is considered to be efficient in the sense that it issues fewer number of cancel messages and avoids unnecessary resetting operations. Furthermore, it performs independent redoing and resetting more concurrently than other related works.
Martin-Löf's type theory contains a logic, a specification language and a programming language, so it is a tool with different uses. Although it is traditionally used as an integrated programming logic, it ma...
详细信息
A method is proposed to search for an identifier in a functional program library by using its Hindley-Milner type as a key. This can be seen as an approximation of using the specification as a key. Functions that only...
We introduce a definitional extension of logic programming by means of an inference schema (Ph), which, in acertain sense, is dual to the (1-P) schema of rule application discussed in Part I. In the operational semant...
作者:
KING, JFBARTON, DEJ. Fred King:is the manager of the Advanced Technology Department for Unisys in Reston
Virginia. He earned his Ph.D. in mathematics from the University of Houston in 1977. He has been principal investigator of research projects in knowledge engineering pattern recognition and heuristic problem-solving. Efforts include the development of a multi-temporal multispectral classifier for identifying graincrops using LANDSAT satellite imagery data for NASA. Also as a member of the research team for a NCI study with Baylor College of Medicine and NASA he helped develop techniques for detection of carcinoma using multispectral microphotometer scans of lung tissue. He established and became technical director of the AI Laboratory for Ford Aerospace where he developed expert scheduling modeling and knowledge acquisition systems for NASA. Since joining Unisys in 1985 he has led the development of object-oriented programming environments blackboard architectures data fusion techniques using neural networks and intelligent data base systems. Douglas E. Barton:is manager of Logistics Information Systems for Unisys in Reston
Virginia. He earned his B.A. degree in computer science from the College of William and Mary in 1978 and did postgraduate work in London as a Drapers Company scholar. Since joining Unisys in 1981 his work has concentrated on program management and software engineering of large scale data base management systems and design and implementation of knowledge-based systems in planning and logistics. As chairman of the Logistics Data Subcommittee of the National Security Industrial Association (NSIA) he led an industry initiative which examined concepts in knowledge-based systems in military logistics. His responsibilities also include evaluation development and tailoring of software engineering standards and procedures for data base and knowledge-based systems. He is currently program manager of the Navigation Information Management System which provides support to the Fleet Ballistic Missile Progr
A valuable technique during concept development is rapid prototyping of software for key design components. This approach is particularly useful when the optimum design approach is not readily apparent or several know...
详细信息
A valuable technique during concept development is rapid prototyping of software for key design components. This approach is particularly useful when the optimum design approach is not readily apparent or several known alternatives need to be rapidly evaluated. A problem inherent in rapid prototyping is the lack of a "target system" with which to interface. Some alternatives are to develop test driver libraries, integrate the prototype with an existing working simulator, or build one for the specific problem. This paper presents a unique approach to concept development using rapid prototyping for concept development and scenario-based simulation for concept verification. The rapid prototyping environment, derived from artificial intelligence technology, is based on a blackboard architecture. The rapid prototype simulation capability is provided through an object-oriented modeling environment. It is shown how both simulation and blackboard technologies are used collectively to rapidly gain insight into a tenacious problem. A specific example will be discussed where this approach was used to evolve the logic of a mission controller for an autonomous underwater vehicle.
In this paper definite Horn clause programs are investigated within a proof-theoretic framework;program clauses being considered rules of a formal system. Based on this approach, the soundness and completeness of SLD-...
详细信息
This paper is about specification and verification of processes, modelled as CCS-agents. We show, by means of examples that Hennessy-Milner Logic (HML) with recursion is a suitable language for expressing implicit or ...
详细信息
Networks of communicating processes can be viewed as networks of stream transformers and programmed in a lazy functional language. Thus the correctness of concurrent systems can be reduced to the correctness of functi...
详细信息
We present a method for computing the number of steps needed to compute a lazy first order functional program e (to an approximation of its value). The method itself is described as a lazy functional program. Moreover...
详细信息
ISBN:
(纸本)0897913280
We present a method for computing the number of steps needed to compute a lazy first order functional program e (to an approximation of its value). The method itself is described as a lazy functional program. Moreover, it is compositional, because it is denned by recursion on the structure of e. In other words, the number of steps needed to compute e is described in terms of the number of steps the parts of e need. (This is in contrast with the obvious operational method to define an interpreter and count the number of steps that it needs.) The equations that define the analysing program can also be used when reasoning about time complexity of lazy functional programs. Two simple examples are given at the end of the paper.
暂无评论