This paper introduces a new approach to the conceptual design of mechanical systems from qualitative specifications of behavior. The power of the approach stems from the integration of techniques in qualitative physic...
详细信息
This paper introduces a new approach to the conceptual design of mechanical systems from qualitative specifications of behavior. The power of the approach stems from the integration of techniques in qualitative physics and constraint programming. We illustrate the approach with an effective kinematic synthesis method that reasons with qualitative representations of configuration spaces using constraint programming.
作者：
VANHINTUM, JEAREYNOLDS, GJCWI
Department of Interactive Systems P.O. Box 94079 1090 GB Amsterdam the Netherlands E-mail: hansh@cwi.nl reynolds@cwi.nl
The MADE constraint system provides excellent opportunities to introduce constraints in a multimedia application. Multimedia applications are not only a good place to experiment with constraint systems;constraints in ...
详细信息
The MADE constraint system provides excellent opportunities to introduce constraints in a multimedia application. Multimedia applications are not only a good place to experiment with constraint systems;constraints in a multimedia environment are almost indispensable. Due to the overwhelming amount of data and the number of relations between several parts of this data, multimedia applications almost demand the support of a constraint management system. The MADE constraint system combines the object oriented programming paradigm, inherited from the mC++ language, the declarative constraint programming paradigm and the special requirements imposed upon the constraint system by the multimedia environment. Among other things, the MADE constraint system provides parallel satisfaction techniques;several constraints may be solved simultaneously and this satisfaction process is performed in parallel with the application. This not only reduces the time needed to solve the constraints, it also allows the multimedia application to proceed with its presentation while (beneath the surface) the constraints are maintained. This not only holds for the parts of the presentation that are not constrained at all, but also for those parts that are. Furthermore, the constraint system is transparent to the multimedia application no special coding or preparation of the objects in the application is necessary. constraints can be added later to the application without much work. Besides that, it is also possible to add and remove constraints at runtime;objects may be constrained for only a period of the time the application is running.
constraint logic programming (CLP) has demonstrated its ability to handle difficult problems coming from operation research. We think that this approach is relevant to perform program analyses too. However, program an...
详细信息
In this chapter, we present an application of constraint Logic programming to the examination planning problem of our University. Each year, in June, 4000 students of various branches of instruction have to attend exa...
详细信息
The considerable expressive power and flexibility gained by combining constraint programming with logic programming is not without cost. Implementations of constraint logic programming (CLP) languages must include exp...
详细信息
This article presents a method for extracting a conceptual schema from a relational database. The method is based on an analysis of data manipulation statements in the code of an application using a relational DBMS. A...
详细信息
This article presents a method for extracting a conceptual schema from a relational database. The method is based on an analysis of data manipulation statements in the code of an application using a relational DBMS. Attributes representing references between tables in the relational schema and possible keys are determined by an analysis of join conditions in queries and view definitions. Knowledge about which attributes link tables is used to investigate the database extension in a selective manner. When the keys cannot be unambiguously determined, possible solutions are generated by the system under guidance of the user. The approach makes it possible to efficiently construct a conceptual schema from only rudimentary information.
The purpose of this paper is to show how the introduction of new primitive constraints (e.g., among, diffn, cycle) over finite domains in the constraint logic programming system CHIP result in finding very rapidly goo...
详细信息
The purpose of this paper is to show how the introduction of new primitive constraints (e.g., among, diffn, cycle) over finite domains in the constraint logic programming system CHIP result in finding very rapidly good solutions for a large class of difficult sequencing, scheduling, geometrical placement and vehicle routing problems. The among constraint allows us to specify sequencing constraints in a very concise way. For the first time, the diffn constraint allows us to express and to solve directly multi-dimensional placement problems, where one has to consider nonoverlapping constraints between n-dimensional objects (e.g., rectangles, parallelepipeds). The cycle constraint makes it possible to specify a wide range of graph partitioning problems that could not yet be expressed by using current constraint logic programming languages. One of the main advantages of all these new primitives is to take into account more globally a set of elementary constraints. Finally, we point out that all the previous primitive constraints enhance the power of the CHIP system significantly, allowing us to solve real life problems that were not within reach of constraint technology before.
constraint logic programming can be effectively applied to solve realistic job-shop scheduling problems. The role of constraints is twofold: they model dependencies among tasks and resources (e.g. temporal relations a...
详细信息
In this paper we introduce a modelling, simulation and scheduling system for discrete production processes. It contains a model builder, a simulator and an evaluator manipulator. The model builder allows to create hie...
详细信息
The organization of inpatients circulation between care units and specialized consultations, presents productive analogies with the industrial job shop organizations. Thus, some concepts, methods, and tools of product...
详细信息
ISBN:
(纸本)0780307852
The organization of inpatients circulation between care units and specialized consultations, presents productive analogies with the industrial job shop organizations. Thus, some concepts, methods, and tools of production management could be effective to improve inpatients circulation and appointment management. Looking for such tools, we found that constraint programming languages (CPL) like Charme, especially suited for solving scheduling, planning, and optimization's problems, could be used to develop an optimal multiple appointments management application for inpatients. We describe here the interest, the approach, the tools, and the models, of what is now an a beta-tested application called Madrigal.
暂无评论