G. Kondrak and P.Van Beek. A theoretical evaluation of selected backtracking algorithms. Artificial Intelligence, 89(1-2):365--387, January 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Backjump-based Backtracking for Constraint Satisfaction Problems - Dechter, Frost (2001) (3 citations) (Correct)
....relationships. For instance, as already noted, dynamic variable ordering performs the function of value selection as well as variable selection [2] and when the order of variables is xed, forward checking eliminates the need for backjumping in leaf nodes, as is done in Gaschnig s backjumping [44]. The idea of non systematic complete backtracking was introduced by Makoto Yokoo who was the rst to observe that the use of learning in the context of a distributed version of search maintains completeness [81] This idea caught up recently in the community of SAT solver developers as well. ....
G. Kondrak and P. van Beek. A theoretical evaluation of selected backtracking algorithms. In Proceedings of International Joint Conference of Arti cial Intelligence (IJCAI-94), 1994.
Explanations for Global Constraints: Instrumenting the.. - Rochart, Jussien (Correct)
....often use backtrack algorithms. The main disadvantages of this algorithm are well known: the lack of memory and the lack of relevance imply a thrashing phenomenon. 3. 1 Dynamic Backtracking To compensate these defaults, some explanation based solutions were proposed in the literature: backjumping [8] or dynamic backtracking [2] for instance. An explanation should contain enough information to justify a decision (throwing a contradiction, reducing a domain etc. It will contain all the system constraints and all the choices made during search which allow to justify these inferences. 3 ....
Grzegorz Kondrak. A theoretical evaluation of selected backtracking algorithms. Master's thesis, University of Alberta, 1994. 14
Programming Constraint Services - Schulte (2002) (5 citations) (Correct)
....been proven successful by ILOG Solver [113] Further attempts in this direction are Figaro [55] and CHOCO [74] Dependency Recording The search strategies considered in this thesis do not record and utilize information why a particular node in the search tree failed. So called lookback schemes [29, 68] analyze information found in the search tree s nodes and continue exploration at a node such that the same conflict is not encountered again. This form of exploration requires elaborate control and recording of dependency information. Spaces provide elaborate control. It is interesting to ....
Grzegorz Kondrak and Peter van Beek. A theoretical evaluation of selected backtracking algorithms. Artificial Intelligence, 89(1--2):365--187, January 1997.
Constraint Satisfaction Methods for Applications in.. - Gelle, Faltings.. (2000) (Correct)
....aabc abca abcc D 2 = a,b D 3 = a,b,c D 4 = a,c D 1 = a C X1X3 : ab) ac) C X2X3 : ab) bc) C X2X4 : ba) bc) X 1 X 2 C X3X4 : ca) 3 Figure 1: Search tree solving a small CSP by backtracking. The black nodes have been pruned from the search space. Example taken from [Kondrak, 1994] 2 Constraint Satisfaction Problems (CSPs) A CSP hV; C; Di is de ned by the variables of interest V, each variable X i 2 V with a domain D i 2 D of possible values, and a set of constraints C de ning allowed value combinations over subsets of variables. The goal is to nd one or all solutions ....
Kondrak, G. (1994). A theoretical evaluation of selected backtracking algorithms. Technical Report TR-94-10, University of Alberta.
SmartClients: Constraint satisfaction as a Paradigm for.. - Torrens, Faltings, Pu (2002) (9 citations) (Correct)
....that do not a ect its solutions. Several search algorithms are implemented in the JCL. There are three main algorithms derived from Chronological Backtracking (BT) that are: Backmarking (BM) Backjumping (BJ) and Forward Checking (FC) Combinations of these algorithms yield other algorithms (see [7] for more details on these combined algorithms) which are implemented in the li 12 brary: Constraint directed Backjumping, Graph based Backjumping, Backmarking with Backjumping, Backmarking with constraint directed Backjumping, Backmarking with graph based Backjumping , Forward Checking with ....
Grzegorz Kondrak and Peter van Beek. A Theoretical Evaluation of Selected Backtracking Algorithms. Arti cial Intelligence, 89:365-387, 1997.
A Theoretical Evaluation of Selected Backtracking Algorithms - Grzegorz Kondrak And (1995) (82 citations) Self-citation (Kondrak) (Correct)
....checks within the node follows the order of instantiations. We deal with the more general problem of finding all solutions; at the end of the section we briefly comment on the validity of our results when only one solution is sought. The proofs that are not included here can be found in [6]. Lemma I If BJ backtracks to variable xn from a dead end at variable xi then (al, an) is inconsis tent with xi. Proof After no consistent instantiation can be found for xi, BJ chooses as the point of backtrack the variable xn which is the highest variable in conflict with xi. Let Ci denote ....
....marking scheme on a backtracking algorithm results in a reduction of the number of consistency checks performed. The figure contains also one Forward Checking hybrid: Forward Checking and Conflict Directed Backjumping (FC CBJ) 10] which has not been discussed here. For a treatment of FC CBJ see [6]. Besides the relationships that are shown explicitly, it is important to note the ones that are implicit in the picture. In order to disprove a relationship between 4 and 3, one needs to find at least one constraint satisfaction problem on which 4 is better than B, and one on which B is better ....
G. Kondrak. A theoretical evaluation of selected backtracking algorithms. Technical Report TR94-10, University of Alberta, June 1994.
Branching: the Essence of Constraint Solving - Fernández, Hill (Correct)
No context found.
G. Kondrak and P.Van Beek. A theoretical evaluation of selected backtracking algorithms. Artificial Intelligence, 89(1-2):365--387, January 1997.
Decomposable Constraints - Ian Gent Computer (1999) (7 citations) (Correct)
No context found.
G. Kondrak and P. van Beek. A Theoretical Evaluation of Selected Backtracking Algorithms. Artificial Intelligence, 89:365--387, 1997.
Decomposable Constraints - Ian Gent Kostas (1999) (7 citations) (Correct)
No context found.
G. Kondrak and P. van Beek. A Theoretical Evaluation of Selected Backtracking Algorithms. Artificial Intelligence, 89:365--387, 1997.
Artificial Intelligence 123 (2000) 133--156 - Decomposable Constraints Ian (Correct)
No context found.
G. Kondrak, P. van Beek, A theoretical evaluation of selected backtracking algorithms, Artificial Intelligence 89 (1997) 365--387.
Constraints, Varieties, and Algorithms - van Dongen (2002) (Correct)
No context found.
G. Kondrak and P. van Beek. A theoretical evaluation of selected backtracking methods. Artificial Intelligence, 89:365--387, 1997.
Constraints, Varieties, and Algorithms - van Dongen (2002) (Correct)
No context found.
G. Kondrak and P. van Beek. A theoretical evaluation of selected backtracking algorithms. In C.S. Mellish, editor, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI'95), pages 541--547, 1995.
Decomposable Constraints - Ian Gent Kostas (1999) (7 citations) (Correct)
No context found.
G. Kondrak and P. van Beek. A Theoretical Evaluation of Selected Backtracking Algorithms. Artificial Intelligence, 89:365--387, 1997.
Representation and Reasoning with Non-Binary Constraints - Stergiou (2001) (Correct)
No context found.
G. Kondrak and P. van Beek. A Theoretical Evaluation of Selected Backtracking Algorithms. Arti cial Intelligence, 89:365-387, 1997.
Representation and Reasoning with Non-Binary Constraints - Stergiou (2001) (Correct)
No context found.
G. Kondrak and P. van Beek. A theoretical evaluation of selected backtracking algorithms. In Proceedings of the 14th International Joint Conference on Arti cial Intelligence (IJCAI-95), pages 541-547, Montreal, Canada, 1995.
Efficient Backtracking Instruction Schedulers - Abraham (2000) (Correct)
No context found.
G. Kondrak and P.v. Beek, "A theoretical evaluation of selected backtracking algorithms," Artificial Intelligence, vol. 89, no. 1-2, pp. 365-387, Jan. 1997.
On the Relations between Intelligent Backtracking and.. - Kambhampati (1997) (7 citations) (Correct)
No context found.
G. Kondrak and P. vanBeek. A theoretical evaluation of selected backtracking algorithms. In Proc. IJCAI-95, 1995.
Dynamic Flexible Constraint Satisfaction and its Application to.. - Miguel (2001) (5 citations) (Correct)
No context found.
G. Kondrak and P. van Beek. A theoretical evaluation of selected backtracking algorithms. Proceedings of the Fourteenth International Joint Conference on Arti cial Intelligence, pages 541-547, 1995.
Asynchronous Forward-Checking on DisCSPs - Amnon Meisels And (2003) (1 citation) (Correct)
No context found.
G. Kondrak and P. vanBeek. A Theoretical Evaluation of Selected Backtracking Algorithms, Artificial Intelligence, 89:365-87, 1997.
Concurrent Backtrack Search on DisCSPs - Roie Zivan And (Correct)
No context found.
G. Kondrak and P. vanBeek, A Theoretical Evaluation of Selected Backtracking Algorithms, Artificial Intelligence, 89: 365-87, 1997.
Constraints, Varieties, and Algorithms - van Dongen (2002) (Correct)
No context found.
G. Kondrak and P. van Beek. A theoretical evaluation of selected backtracking methods. Artificial Intelligence, 89:365--387, 1997.
Constraints, Varieties, and Algorithms - van Dongen (2002) (Correct)
No context found.
G. Kondrak and P. van Beek. A theoretical evaluation of selected backtracking algorithms. In C.S. Mellish, editor, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI'95), pages 541--547, 1995.
On Forward Checking for Non Binary Constraint.. - Bessière.. (1999) (9 citations) (Correct)
No context found.
G. Kondrak and P. van Beek. A theoretical evaluation of selected backtracking algorithms. Articial Intelligence, 89:365387, 1997.
Reasoning with Disjunctive Fuzzy Temporal Constraint Networks - Bosch, Torres, Marin (2002) (Correct)
No context found.
Kondrak, G., van Beek, P.: A Theoretical Evaluation of Selected Backtracking Algorithms. Artificial Intelligence 89 (1997) 365-387
Maintaining Dominance Consistency - No Author Given (Correct)
No context found.
Grzegorz Kondrak and Peter van Beek. A theoretical evaluation of selected backtracking algorithms. In Chris Mellish, editor, IJCAI'95: Proceedings International Joint Conference on Arti cial Intelligence, Montreal, 1995.
First 50 documents Next 50
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