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 tra...
详细信息
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].
logicprogramming 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,...
详细信息
ISBN:
(纸本)3540206426
logicprogramming 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.
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", &...
详细信息
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.
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...
详细信息
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.
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...
详细信息
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.
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 ware...
详细信息
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.
In this paper we propose a semantically well-founded combination of the constraint solvers used in the constraintprogramming languages CLP(SET) and CLP(FD). This work demonstrates that it is possible to provide effic...
详细信息
ISBN:
(纸本)9781581137057
In this paper we propose a semantically well-founded combination of the constraint solvers used in the constraintprogramming 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.
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 logicprogramming, con...
详细信息
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 logicprogramming, 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 logicprogramming 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).
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 t...
详细信息
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.
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 ...
详细信息
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 constraintlogic solver for network flow problems. (C) 1999 Elsevier Science B.V. All rights reserved.
暂无评论