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

Abstract verification and debugging of constraint logic programs 1

Joint ERCIM/CologNet International Workshop on constraint Solving and constraint logic programming

作者： Hermenegildo, M Puebla, G Bueno, F López-García, P Tech Univ Madrid UPM Dept Comp Sci Madrid Spain

ISBN: (数字)9783540366072

ISBN: (纸本)3540009868

The technique of Abstract Interpretation [13] has allowed the development of sophisticated program analyses which are provably correct and practical. The semantic approximations produced by such analyses have been traditionally applied to optimization during program compilation. However, recently, novel and promising applications of semantic approximations have been proposed in the more general context of program verification and debugging [3],[10],[7].

关键词： global analysis debugging verification constraint logic programming optimization parallelization abstract interpretation

来源：评论

学校读者我要写书评

暂无评论

A real implementation for constructive negation

引用

19th International Conference on logic programming

作者： Muñoz, S Moreno-Navarro, JJ Univ Politecn Madrid Fac Informat LSIIS Madrid 28660 Spain

ISBN: (纸本)3540206426

logic programming has been advocated as a language for system specification, especially for logical behaviours, rules and knowledge. However, modeling problems involving negation, which is quite natural in many cases, is somewhat restricted if Prolog is used as the specification/implementation language. These constraints are not related to theory viewpoint, where users can find many different models with their respective semantics; they concern practical implementation issues. The negation capabilities supported by current Prolog systems are rather limited, and a correct and complete implementation there is not available. Of all the proposals, constructive negation [1,2] is probably the most promising because it has been proven to be sound and complete [4], and its semantics is fully compatible with Prolog’s.

关键词： constructive negation negation in logic programming constraint logic programming implementations of logic programming

来源：评论

学校读者我要写书评

暂无评论

Cardinality constraints in disjunctive deductive databases

引用

2nd International Workshop on Semantics in Databases

作者： Seipel, D Geske, U Univ Wurzburg Dept Comp Sci D-97074 Wurzburg Germany Fraunhofer First Berlin D-12489 Berlin Germany

ISBN: (纸本)3540009574

We investigate cardinality constraints of the form M -theta K, where M is a set and theta is one of the comparison operators or "greater than or equal to";such a constraint states that "exactly", "at most", or "at least", respectively, K elements out of the set M have to be chosen. We show how a set C of constraints can be represented by means of a positive-disjunctive deductive database P(c), such that the models of P(c) correspond to the solutions of C. This allows for embedding cardinality constraints into applications dealing with incomplete knowledge. We also present a sound calculus represented by a definite logic program P(cc), which allows for directly reasoning with sets of exactly-cardinality constraints (i.e., where theta is "="). Reasoning with P(cc) is very efficient, and. it can be used for performance reasons before P(c) is evaluated. For obtaining completeness, however, P(c) is necessary, since we show the theoretical result that a sound and complete calculus,for exactly-cardinality constraints does not exist.

关键词： disjunctive logic programming constraint logic programming cardinality constraints hyperresolution

来源：评论

学校读者我要写书评

暂无评论

Cooperation and competition of agents in the auction of computer bridge

引用

ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE 2003年第12期86卷 76-86页

作者： Ando, T Kobayashi, N Uehara, T Tokyo Univ Technol Hachioji Tokyo 1928580 Japan

The auction in contract bridge is a game with incomplete information. This paper models the process as an interaction among agents with a hypothetical reasoning mechanism. The criterion for the action of each agent is defined as "maximizing gain by cooperating with the partner and minimizing loss by competing with the opponents." An agent with the following characteristics is created. Based on the course of bidding, the hands of both sides are estimated by hypothetical reasoning. Then flexible bids are made in an effort to obtain the contract with the greatest gain or smallest loss of points. Experiments show that in a game with incomplete information, it is useful not only to send information to the partner, but also to disrupt information exchange by the opponents. The effect of ambiguity of information on the behavior of both sides is discussed. (C) 2003 Wiley Periodicals, Inc.

关键词： game with incomplete information computer bridge agent hypothetical reasoning constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Integrating finite domain constraints and CLP with sets 03

Integrating finite domain constraints and CLP with sets

引用

Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming

作者： A. Dal Palú A. Dovier E. Pontelli G. Rossi Università di Udine New Mexico State University Università di Parma

ISBN: (纸本)9781581137057

In this paper we propose a semantically well-founded combination of the constraint solvers used in the constraint programming languages CLP(SET) and CLP(FD). This work demonstrates that it is possible to provide efficient executions (through CLP(FD) solvers) while maintaining the expressive power and flexibility of the CLP(SET) language. We develop a combined constraint solver and we show how static analysis can help in organizing the distribution of constraints to the two constraint solvers.

关键词： constraint logic programming programming with sets

来源：评论

学校读者我要写书评

暂无评论

Effective algorithm for handling constraints in generator maintenance scheduling

引用

IEE PROCEEDINGS-GENERATION TRANSMISSION AND DISTRIBUTION 2002年第3期149卷 274-282页

作者： Huang, KY Yang, HT Cheng Shiu Inst Technol Dept Elect Engn Kaohsiung 833 Taiwan Chung Yuan Christian Univ Dept Elect Engn Chungli 32023 Taiwan

An effective algorithm for handling constraints to solve the generator maintenance scheduling (GMS) problem is presented. The proposed algorithm of constraint logic programming (CLP) synthesises logic programming, constraint satisfaction technique (CST), and branch and bound search schemes to provide an efficient and flexible approach to the problem. The constraints of the problem cannot only be conveniently managed by the logic programming but also be actively used to reduce the search space by the CST. Once the infeasible solutions are pruned away from the search space, the depth-first branch and bound search strategy is then used for determining the optimal solution. The practical GMS problem of Taiwan Power (Taipower) system is solved by the proposed CLP algorithm for demonstrating its effectiveness. To exhibit the efficiency of the proposed algorithm, the results obtained are compared with those from the established methods of simulated annealing (SA) and lagrangian relaxation (LR).

关键词： search space reduction Lagrangian relaxation logic programming Power engineering computing generator maintenance scheduling constraints handling maintenance engineering power engineering computing electric generators logic programming a.c. machines Taiwan Power Generating stations and plants simulated annealing Taipower Maintenance and reliability constraint handling branch and bound search schemes constraint logic programming constraint satisfaction technique depth-first branch and bound search strategy d.c. machines power generation scheduling Plant engineering, maintenance and safety

来源：评论

学校读者我要写书评

暂无评论

Using parametric set constraints for locating errors in CLP programs

引用

THEORY AND PRACTICE OF logic programming 2002年第4-5期2卷 549-610页

作者： Drabent, W Maluszynski, J Pietrzak, P Linkoping Univ Dept Comp & Informat Sci S-58183 Linkoping Sweden Polish Acad Sci Inst Comp Sci PL-01237 Warsaw Poland

This paper introduces a framework of parametric descriptive directional types for constraint logic programming (CLP). It proposes a method for locating type errors in CLP programs, and presents a prototype debugging tool. The main technique used is checking correctness of programs w.r.t. type specifications. The approach is based on a generalization of known methods for proving the correctness of logic programs to the case of parametric specifications. Set constraint techniques are used for formulating and checking verification conditions for (parametric) polymorphic type specifications. The specifications are expressed in a parametric extension of the formalism of term grammars. The soundness of the method is proved, and the prototype debugging tool supporting the proposed approach is illustrated on examples. The paper is a substantial extension of the previous work by the same authors concerning monomorphic directional types.

关键词： constraint logic programming parametric types descriptive types program correctness debugging set constraints term grammars

来源：评论

学校读者我要写书评

暂无评论

A decision support systems generator for transportation demand forecasting implemented by constraint logic programming

引用

DECISION SUPPORT SYSTEMS 1999年第3期26卷 179-194页

作者： Fierbinteanu, C Univ Electrocommun Grad Sch Informat Syst Tokyo 1828585 Japan

In this paper we propose a framework for a decision support systems (DSS) generator for constrained search problems, implemented by constraint logic programming (CLP). We illustrate this concept by the implementation of a DSS generator for transportation demand forecasting. The user interface of the DSS generator is an intelligent, graphical editor that supports the construction of a specific DSS from basic building blocks. Additional constraints are specified as distinct building blocks, and the constraint solver of the host CLP language is extended with domain-specific constraint manipulation. The design of the system is based on ontological modeling. The originality of our approach, which achieves the transition from custom imperative programming to declarative programming in the field of transportation demand forecasting, consists of the model of the generator, as well as of the constraint logic solver for network flow problems. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： decision support systems generator constraint logic programming transportation demand forecasting ontology computational geometry network flows

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：