检索结果-内蒙古大学图书馆

Implementation of Systems with Declarative constraints

IFAC Proceedings Volumes 1994年第11期27卷 361-366页

作者： J. Csonto Technical University of Kosice Department of Cybernetics and AI Letna 9 041 20 Kosice Slovakia

The methodology of constraint logic programming (CLP), combining the declarative aspect of standard logic programming 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.

关键词： constraint logic programming artificial intelligence constraint theory scheduling software tools

来源：评论

学校读者我要写书评

暂无评论

Design for AJACS, yet another Java constraint programming framework 1

引用

Electronic Notes in Theoretical Computer Science 2001年 48卷 167-178页

作者： Lígia Ferreira Salvador Abreu Departmento de Informática Universidade de Évora Évora Portugal

This article introduces AJACS (Another Java constraint programming System), a toolkit for Concurrent constraint programming implemented in the Java language. It comes as a successor to our previous work in implementing constraint programming idioms in Java, GC [5], in that it represents an attempt to deal with some of GC's inadequacies in terms of performance whilst providing a setting which is adequate to express problems in a way that can be easily solved in a parallel execution environment, as provided by a concurrent programming setting. We claim that AJACS provides a very flexible toolkit for use in general applications that may benefit from constraint programming techniques. We also claim that AJACS allows for the coding of CSP problems whose solution is amenable to a practically effortless parallelization.

关键词： constraint logic programming Concurrent constraints Java.

来源：评论

学校读者我要写书评

暂无评论

A practical object-oriented analysis engine for CLP

引用

SOFTWARE-PRACTICE & EXPERIENCE 1998年第2期28卷 199-224页

作者： Kelly, AD Marriott, K Sondergaard, H Stuckey, PJ Monash Univ Dept Comp Sci Clayton Vic 3168 Australia Univ Melbourne Dept Comp Sci Parkville Vic 3052 Australia

The incorporation of global program analysis into recent compilers for constraint logic programming (CLP) languages has greatly improved the efficiency of compiled programs. We present a global analyser based on abstract interpretation. Unlike traditional optimizers, whose designs tend to be ad hoc, the analyser has been designed with flexibility in mind. The analyser is incremental, allowing substantial program transformations by a compiler without requiring redundant re-computation of analysis data. The analyser is also generic in that it can perform a large number of different program analyses. Furthermore, the analyser has an object-oriented design, enabling it to be adapted to different applications easily and allowing it to be used with various CLP languages with simple modifications. As an example of this generality, we sketch the use of the analyser in two different applications involving two distinct CLP languages: an optimizing compiler for CLP(R) programs and an application for detecting occur-check problems in Prolog programs. (C) 1998 by John Whey & Sons Ltd.

关键词： program analysis abstract interpretation object-oriented constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Constrained resolution and abductive temporal reasoning

引用

COMPUTATIONAL INTELLIGENCE 1996年第3期12卷 383-406页

作者： Chleq, N INRIA Sophia-Antipolis BP 93 06902 Sophia Antipolis Cedex France

This article presents our work on the effective implementation of abduction in temporal reasoning. This works builds on some results, both in the logic programming field and in the automated reasoning area. We have defined and implemented an abductive procedure, which is well adapted for temporal reasoning because it is based on a constrained resolution principle. Constrained resolution has two advantages for temporal reasoning: First, it allows us to deal efficiently with temporal ordering and equality predicates, which are otherwise too much trouble with classical resolution;second, it allows a restricted form of abduction where hypotheses are limited to ordering relationships. From the logic programming area, our work uses results and procedures developed by others in the abductive logic programming field. The procedure we define and implement in this work is relatively independent of the temporal formalism: It has been used with some reified temporal logics and with the event calculus. More generally it can be used on any point-based temporal formalism, provided that a correct and complete algorithm is available for checking the consistency of a set of temporal ordering relationships in this language.

关键词： temporal reasoning abduction planning constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

PORTFOLIO SELECTION OF NEW PRODUCT PROJECTS: A PRODUCT RELIABILITY PERSPECTIVE

引用

EKSPLOATACJA I NIEZAWODNOSC-MAINTENANCE AND RELIABILITY 2016年第4期18卷 613-620页

作者： Relich, Marcin Univ Zielona Gora Fac Econ & Management Ul Licealna 9 PL-65417 Zielona Gora Poland

Portfolio selection of new product development projects is one of the most important decisions in an enterprise that impact future business profits, competitiveness and survival. Ensuring reliability in a new product is costly but it increases customer satisfaction and reduces the potential warranty cost, contributing to product success. This paper aims to develop an approach for designing decision support system of selecting portfolio of new product development projects, taking into account the aspect of ensuring the desired reliability of products. A portfolio selection problem is formulated in terms of a constraint satisfaction problem that is a pertinent framework for designing a knowledge base. A set of admissible solutions referring to the new product alternatives is obtained with the use of constraint logic programming. The proposed approach is dedicated for enterprises that modernise existing products to develop new products.

关键词： cost estimation project alternatives constraint satisfaction problem constraint logic programming decision support system

来源：评论

学校读者我要写书评

暂无评论

Resource leveling scheduling system: A two-phase CLP relaxation method

引用

ELECTRONICS AND COMMUNICATIONS IN JAPAN PART II-ELECTRONICS 2003年第6期86卷 62-72页

作者： Takada, M Terano, T Mitsubishi Chem Corp Ctr Res Dev & Engn Ibaraki 3140102 Japan Univ Tsukuba Grad Sch Syst Management Tokyo 1120012 Japan

We have developed a production scheduling system called "K-CHIP," which handles operator resource leveling, using CLP (constraint logic programming). This system has the following features: (1) it approaches constraint satisfaction problems (CSP) as two-phase problems, consisting of production line scheduling and operator assignment scheduling, (2) it uses an interactive method for relaxing constraints on operator skills and on the number of operators as the intra-CSP adjustment method, and (3) it guarantees skill constraint satisfaction by creating a future training schedule. A simulation carried out based on this system produced the prospect of a 33% reduction in manpower. The simulation also demonstrated that the method can be effectively utilized to expand the system integration functions, centered on skills that are the main concern in plant management. (C) 2003 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 86(6): 62-72, 2003;Published online in Wiley InterScience (***). DOI 10.1002/ecjb.10156.

关键词： constraint logic programming leveling constraint satisfaction problem constraint relaxation problem production scheduling

来源：评论

学校读者我要写书评

暂无评论

A case of business model conversion using planning and scheduling application having intermediate cutting stock

引用

JSME INTERNATIONAL JOURNAL SERIES C-MECHANICAL SYSTEMS MACHINE ELEMENTS AND MANUFACTURING 2003年第1期46卷 93-99页

作者： Takada, M Mitsubishi Chem Corp Sci & Technol Res Ctr Kashima Ibaraki 3140102 Japan

This paper describes the experience of developing a production planning and scheduling system, which makes more than 1700 kinds of end products from more than 300 kinds of large plates stocked in the intermediate warehouse. This system was mostly achieved with constraint logic programming. As our business environments having changed, we ware in urgent need of converting our production method to the pull-type from the push-type. With the push-type production method, we have to keep our finish products in stock for three to four months and refill the stock in 30 days. The features of our system: it solved the complex network problem of 38 patterns found in the whole production process from cutting to shipment in generic way. At the former process, it also solved an optimization of the setups problem in the two-phase batch-type production.

关键词： constraint logic programming business process optimization cutting stock probrem scheduling planning APS SCM

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Multi-agent Approach to the Solving Supply Chain Problems

引用

Procedia Computer Science 2014年 35卷 1557-1566页

作者： Paweł Sitek Izabela Ewa Nielsen Jarosław Wikarek Kielce University of Technology Institute of Management and Control Systems 25-314 Kielce Poland University Department of Mechanical and Manufacturing Engineering Alborg Denmark

The paper presents a concept and application of a hybrid multi-agent approach to modeling and optimization the supply chain problems. Two environments (mathematical programming (MP) and constraint logic programming (CLP)) and two types of agents were integrated. This integration and hybridization, complemented with an adequate transformation of the problem, facilitates a significant reduction of the combinatorial problem. The whole process takes place at the implementation layer, which makes it possible to use the structure of the problem being solved, implementation environments and the very data. The strengths of MP and CLP, in which constraints are treated in a different way and different methods are implemented, were combined to use the strengths of both. The proposed approach is particularly important for the decision models with an objective function and many discrete decision variables added up in multiple constraints. The presented multi-agent approach will be compared with classical mathematical programming on the same data sets and models. In addition, the proposed approach will be used for modelling and optimization of the hybrid model, which has not only linear constraints but also logical constraints.

关键词： multi-agent constraint logic programming mathematical programming optimization supply chain management hybridization

来源：评论

学校读者我要写书评

暂无评论

Handling State-Machines Specifications with GATeL

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2010年第3期264卷 3-17页

作者： Blanc, Benjamin Junke, Christophe Marre, Bruno Le Gall, Pascale Andrieu, Olivier CEA LIST Software Reliabil Lab LSL Palaiseau France Ecole Cent Paris MAS Lab Chatenay Malabry France Univ Evry Evry France Esterel Technol Elancourt France

GATeL proposes a testing environment for Lustre/Scade programs. Its main component is a resolution procedure based on a CLP interpretation of its input language. This paper presents a two-tier extension of GATeL in order to take into account state-machines descriptions. This extension relies on a compilation of these constructs into multi-clocked expressions. Our first contribution is a definition of explicit constraints to manage the clock type hierarchy in GATeL. The second one is the definition of constraints reflecting properties of state-machines built by the Scade compilation schema.

关键词： Reactive systems State-Machines Test Generation constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Program transformation for development, verification, and synthesis of programs

引用

INTELLIGENZA ARTIFICIALE 2011年第1期5卷 119-125页

作者： Fioravanti, Fabio Pettorossi, Alberto Proietti, Maurizio Senni, Valerio Univ G D Annunzio Dept Sci Pescara Italy Univ Roma Tor Vergata Dept Informat Syst & Prod Rome Italy CNR IASI Viale Manzoni 30 I-00185 Rome Italy

This paper briefly describes the use of the program transformation methodology for the development of correct and efficient programs. In particular, we will refer to the case of constraint logic programs and, through ... 详细信息

关键词： constraint logic programming model checking program development program synthesis unfold/fold program transformation software verification

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：