Y.J. Jiang, T. Richards, and B. Richards. No-good backmarking with min-conflict repair in constraint satisfaction and optimization. In Proc. 2nd Principles and Practice of Constraint Programming workshop, 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....storage cost, while also increasing the chance that they will be useful in other search branches. The two schemes above are static in that once a nogood is remembered, it will never be forgotten. Another class of approaches forget some of the stored nogoods as the search progresses. Jiang et al. (Jiang, Richards, Richards, 1994) propose forgetting previously stored nogoods that are subsumed by (i.e. are less general than ) the newly learned nogoods. Another idea is to use some syntactic notion of the short term relevance of the nogood for the current search node, to decide whether to purge some of the nogoods (which ....

Jiang, Y., Richards, T., & Richards, B. (1994). No-good backmarking with min-conflict repair in constraint satisfaction and optimization. In Proc. 2nd Principles and Practice of Constraint Programming workshop.

....for solving CSPs and not specifically designed for DCSOPs (naturally distributed problems) In this paper, we propose a generic distributed repair based algorithm for solving DCSOPs. 2 Background Our algorithm was motivated by two previous works: the NG backmarking repair based technique [7, 12] and the canonical model for DCSPs presented in [13] 2.1 The NG Backmarking Repair based Technique NG backmarking was first introduced in [7] and then further enhanced with domain filtering in [12] It is based on nogood learning, which has been extensively explored previously in the context of ....

....repair based algorithm for solving DCSOPs. 2 Background Our algorithm was motivated by two previous works: the NG backmarking repair based technique [7, 12] and the canonical model for DCSPs presented in [13] 2. 1 The NG Backmarking Repair based Technique NG backmarking was first introduced in [7] and then further enhanced with domain filtering in [12] It is based on nogood learning, which has been extensively explored previously in the context of backtracking based search [3, 2] Unlike other repair based algorithms, it guarantees to find an optimal solution if one exists, and jumps out ....

[Article contains additional citation context not shown here]

Y. Jiang, T. Richards, and B. Richards. Nogood Backmarking with Min-conflict Repair in Constraint Satisfaction and Optimization. In Proceedings of Principles and Practice of Constraint Programming, pages 21--39, 1994.

....information to reduce the number of solutions it must enumerate to find an optimal solution. The problem solving idea is basically that of learning from one s mistakes. It has been developed in a general way in the constraint programming literature under the rubric of nogoods ( 22] Section 5. 4; [16]) When in the process of solving a problem one deduces that a certain partial solution cannot be completed to obtain a feasible solution, one can examine the reasons for this. Often the same reasons lead to a constraint that excludes a number of partial solutions. Such a constraint is a ....

Jiang, Y., T. Richards and B. Richards, No-good backmarking with minconflict repair in constraint satisfaction and optimization, in A. Borning, ed., Principles and Practice of Constraint Programming, Lecture Notes in Computer Science 874 (1994) 21-39.

....[31] 28] and [19] coping basically with binary CSPs) point to other crucial parameters. You may also consult [12] Experimental studies 6 may now follow to further investigate the practical relevance (as well as the improvements on existing algorithms) Finally, I want to refer to [1] 26] [24], 14] 6] and [9] as instances of entirely different approaches. Backtracking like algorithms are discussed in [34] In summary, the algorithms presented here (as opposed to some other approaches) really guarantee the complete computation of all globally consistent n tuples of a CSP with ....

Yuejun Jiang, Thomas Richards, and Barry Richards. No-good backmarking with min-conflict repair in constraint satisfaction and optimization. In PPCP'94, Second Workshop on the Principles and Practice of Constraint Programming, Rosario, Orcas Island, Washington, USA, May 2-4, 1994.

....are computationally intractable. Many different methods to solve the job shop scheduling problem have been proposed in the literature. Some use operational research techniques [2, 7] Some formulate the jobshop scheduling problem in constraint satisfaction [16, 18] and optimisation problem terms [14, 9]. Others use ATMS techniques [19] Since they are expressed in different formalisms, the task of comparing the different techniques is generally dealt with experimentally. This paper aims to make a contribution to the problem of reformulating and analysing the different techniques in a single ....

.... a reformulation and analysis would both provide guidance on the selection of different methods for different applications of job shop scheduling, and also facilitate the combination of different features arising from different approaches, thus producing more powerful methods (see [16] and [2] [9] and [14] In this paper we formulate job shop scheduling in the theorem proving framework [12, 5] and simulate the Carlier and Pinson method [2] for the optimisation variant of the job shop scheduling problem. This method was the first to solve the notorious 10 Theta 10 job shop problem ....

Jiang, Y.J., Richards, E.T., Richards, E.B., No-good backmarking with min-conflict repair in constraint satisfaction and optimisation. PPCP'94 - Second Workshop on the Principles and Practice of Constraint Programming, Orcas Island, Washington (1994)

....RestartRepair LbM MC coupled with forward checking is styled RestartRepair LbM FC MC . Whereas, RestartRepair LbM BinOrd coupled with forward checking is styled learnSAT to reflect the SAT specific heuristic binary ordering. 2. 6 Ng backmarking The origins of RestartRepair LbM lie in Jiang et al. 1994] and Richards et al. 1995] Here we used learning by merging in the context of ng backmarking. ########################################################## ## # #ELQDU #FODXVH#LQYROYHV#H[DFWO #WZR#OLWHUDOV###6HH# KDSWHU###IRU#GHWDLOV# ## Ng backmarking was designed to address two key ....

....that in arbitrary choice dynamic backtracking [Ginsberg McAllester, 1994] although it was developed independently. The learning method is simple dead end learning. That is, when a dead end is discovered, the entire dead end partial labelling which is under construction is recorded as a no good. Jiang et al. 1994] also explore several other forms of learning, among them learning by merging. This is the form of the algorithm which is relevant here, and the one we shall illustrate below. There are two fundamental differences between ng backmarking and RestartRepair LbM , the first relating to the basic ....

[Article contains additional citation context not shown here]

Y. Jiang, E. T. Richards, and B. Richards, No-good backmarking with min-conflict repair in constraint satisfaction and ### optimisation, Proceedings PPCP-94 2nd International Workshop, Washington State USA, 1994

....no good learning mechanism is effectively managed. No good learning has been widely studied in the context of backtrack search [Dechter, 1990; Frost Dechter, 1994; Schiex Verfaillie, 1993 and 1994] Research has also been initiated into no good learning and non systematic search [Yokoo, 1994; Jiang et al. 1994; Richards et al. 1995; Ginsberg, 1993] In this paper we continue the investigation of Richards Richards [1996] which focuses on a particular combination of no good learning and nonsystematic search, referred to there as WC NG FC. WC NG FC has four basic components: restart, ....

....which cannot be extended further without violating a constraint, the search is abandoned and restarts from the beginning. This process is implemented as part of a repair strategy, which is essential to the algorithm. Learning bymerging (Lbm) originates from the work of Maruyama et al. 1991] and Jiang et al. 1994]; it is fully described in Richards et al. 1995] Similar learning techniques have been developed independently by a number of people, among them Schiex Verfaillie [1993] Ginsberg [1993] and Frost Dechter [1994] The min conflicts heuristic (MC) to guide search can be traced to Minton et al. ....

Y. Jiang, E. T. Richards, and B. Richards, No-good backmarking with min-conflict repair in constraint satisfaction and optimisation, Proceedings PPCP-94 2nd International Workshop, Washington State USA, 1994

No context found.

Y.J. Jiang, T. Richards, and B. Richards. No-good backmarking with min-conflict repair in constraint satisfaction and optimization. In Proc. 2nd Principles and Practice of Constraint Programming workshop, 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC