Behaviour is a reflection of a reasoning process that must deal with constraints imposed by an external environment, internal knowledge and physical structure. This paper proposes a framework for behavioural animation...
详细信息
Behaviour is a reflection of a reasoning process that must deal with constraints imposed by an external environment, internal knowledge and physical structure. This paper proposes a framework for behavioural animation that is based on the next generation of object-oriented, constraint-based expert systems technology, and applies a control structure of knowledge agents and knowledge units to determine the behaviour of objects to be animated. Knowledge agents are responsible for planning, plan implementation and information extraction from the environment. The activity of an agent is dependent on the knowledge units ascribed to them by the animator. The interaction between agents and knowledge units is resolved by the reasoning engine, and thus, influences the eventual motion displayed. An example given in NSAIL, a pilot implementation using the model-based ECHIDNA constraint logic programming shell. With this approach, the motion for a sailing scenario and other behavioural domains can be specified at a high level through the characterization of the knowledge agents.
There have been many proposals for adding sound implementations of numeric processing to Prolog. This paper describes an approach to numeric constraint processing which has been implemented in Echidna, a new constrain...
详细信息
The methodology of constraint logic programming (CLP), combining the declarative aspect of standard logicprogramming languages with efficient constraint solving techniques is presented. An experimental scheduling sys...
详细信息
The methodology of constraint logic programming (CLP), combining the declarative aspect of standard logicprogramming languages with efficient constraint solving techniques is presented. An experimental scheduling system, based on modified Allen’s temporal relationships and implemented in the ECL i PS* programming environment is described. Formulations of scheduling problems and results are presented.
Incremental search consists of adding new constraints or deleting old ones once a solution to a search problem has been found. Although incremental search is of primary importance in application areas such as scheduli...
详细信息
constraint logic programming is a relatively new and promising paradigm. In this paper it is shown that this approach yields flexible tools to support financial decision making. As an example we present an asset and l...
详细信息
The presentation of constraints in a usable form is an essential aspect of constraint logic programming (CLP) systems. It is needed both in the output of constraints, as well as in the production of an internal repres...
详细信息
The presentation of constraints in a usable form is an essential aspect of constraint logic programming (CLP) systems. It is needed both in the output of constraints, as well as in the production of an internal representation of constraints for meta-level manipulation. Typically, only a small subset x of the variables in constraints is of interest, and so an informal statement of the problem at hand is: given a conjunction c(x,y) of constraints, express the projection there exists y c(x,y) of c onto x in the simplest form. In this paper, we consider the constraints of the CLP(R) system and describe the essential features of its projection module. One main part focuses on the well-known problem of projection in linear arithmetic constraints. We start with a classical algorithm and augment it with a procedure for eliminating redundant constraints generated by the algorithm. A second part discusses projection of the other object-level constraints: equations over trees and nonlinear equations. The final part deals with producing a manipulable form of the constraints, which complicates the projection problem.
作者：
RUEHER, M135
Université de Nice—Sophia Antipolis Bat.4—250 Avenue Einstein Sophia Antipolis 06560 Valbonne France
This paper explores PrologIII's capabilities through the study of two short but non-trivial applications that are chosen to show the advantages of constraint logic programming languages over conventional Prologs, ...
详细信息
This paper explores PrologIII's capabilities through the study of two short but non-trivial applications that are chosen to show the advantages of constraint logic programming languages over conventional Prologs, especially for tackling combinatorial problems. The first application (manipulation of causal graphs) highlights the expressive power of the constraints on booleans and shows that constraint logic programming techniques provide great flexibility for the exploration of the domain of an application, and therefore significantly improve Prolog's prototyping capabilities. The second application (map colouring) demonstrates that a combined use of numerical constraints and constraints on trees of Prologlll enables one to improve solutions based on standard backtracking, through the use of simple heuristics. Such heuristics allow drastic reduction of the search space and yield good performance even for quite complex problems. The adaptability of the approach to other combinatorial problems is shown on several examples.
作者：
Bowen, JonathanOxford University
Computing Laboratory Programming Research Group Oxford OX1 3QD 11 Keble Road United Kingdom
A compiler may be specified by a description of how each construct of the source language is translated into a sequence of object code instructions. It is possible to produce a compiler prototype almost directly from ...
详细信息
暂无评论