P. T. Cox and T. Pietrzykowski. Deduction plans : a basis for intelligent backtracking. IEEE PAMI, 3(1), 1981.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....present in otherwise similar and box contexts, contained in a common choice box. This can be seen as an eager generation of alternative resolvents, as opposed to the lazy policy of using choice points in traditional Prolog. Surprisingly enough, this scheme is related to the proof procedure of [7] where alternative resolvents are also generated eagerly. In (b) choice boxes S1 and S2 are copies of S1 and S2. This copying scheme on choice split will greatly influence the operational definition of our backward execution strategy. Indeed, our aim of reordering continuation goals upon ....

P. T. Cox and T. Pietrzykowski. Deduction plans : a basis for intelligent backtracking. IEEE PAMI, 3(1), 1981.

....[3] Prolog systems based on the WAM are implemented during the last decade. In this paper, we will assume that the reader is familiar with the WAM. The details of the WAM can be found in Warren s original paper [17] and Kaci s tutorial book on the WAM [1] Many intelligent backtracking schemes [4, 5, 6, 7, 9, 11, 12, 13, 14, 16, 19] are presented to avoid unnecessary backtracking steps. Early works in intelligent backtracking [4, 9, 14] are implemented as Prolog interpreters. Implementations of later works [6, 7, 11, 12] are WAM based systems. Our intelligent backtracking schema whose some parts are presented in this paper ....

....with the WAM. The details of the WAM can be found in Warren s original paper [17] and Kaci s tutorial book on the WAM [1] Many intelligent backtracking schemes [4, 5, 6, 7, 9, 11, 12, 13, 14, 16, 19] are presented to avoid unnecessary backtracking steps. Early works in intelligent backtracking [4, 9, 14] are implemented as Prolog interpreters. Implementations of later works [6, 7, 11, 12] are WAM based systems. Our intelligent backtracking schema whose some parts are presented in this paper is implemented as an extension of the WAM, like the systems in [6, 11] Our mechanism is similar to the ....

[Article contains additional citation context not shown here]

Cox P. and Pietrzylowski T., Deduction Plans: A Basis for Intelligent Backtracking, IEEE PAMI, Vol 3, 1981.

....point may not be the most recent choice point. In other words, alternatives of choice points between the most recent one and the chosen one are discarded without retrying them. If they were retried, the system would have reencountered with the same failure. Many intelligent backtracking schemes [Bru84, Cha85, Cod88, Cod91, Cox81, Lin87, Lin88, Per82] are presented to avoid unnecessary backtracking steps. Early works in intelligent backtracking [Bru84, Cox81, Per82] are implemented as prolog interpreters. Implementations of later works [Lin87, Lin88, Cod88, Cod91] are WAM based systems. Direct comparisons of early works with later works may ....

....without retrying them. If they were retried, the system would have reencountered with the same failure. Many intelligent backtracking schemes [Bru84, Cha85, Cod88, Cod91, Cox81, Lin87, Lin88, Per82] are presented to avoid unnecessary backtracking steps. Early works in intelligent backtracking [Bru84, Cox81, Per82] are implemented as prolog interpreters. Implementations of later works [Lin87, Lin88, Cod88, Cod91] are WAM based systems. Direct comparisons of early works with later works may not give fruitful results because the machinery used in early works are much slower than the WAM based implementations ....

Cox P. and Pietrzylowski T., Deduction Plans: A Basis for Intelligent Backtracking, IEEE PAMI, Vol 3, 1981.

....based on the WAM are implemented during last decade. During discussions in this paper, we will assume that the reader has a familiarity with the WAM. Details of the WAM can be found in Warren s original paper [16] and Kaci s tutorial book on the WAM [1] Many intelligent backtracking schemes [3, 4, 5, 6, 8, 10, 11, 12, 13, 15, 18] are presented to avoid unnecessary backtracking steps. Early works in intelligent backtracking [3, 8, 13] are implemented as Prolog interpreters. Implementations of later works [5, 6, 10, 11] are WAM based systems. Our intelligent backtracking schema whose some parts are presented in this paper ....

....with the WAM. Details of the WAM can be found in Warren s original paper [16] and Kaci s tutorial book on the WAM [1] Many intelligent backtracking schemes [3, 4, 5, 6, 8, 10, 11, 12, 13, 15, 18] are presented to avoid unnecessary backtracking steps. Early works in intelligent backtracking [3, 8, 13] are implemented as Prolog interpreters. Implementations of later works [5, 6, 10, 11] are WAM based systems. Our intelligent backtracking schema whose some parts are presented in this paper is implemented as an extension of the WAM same as systems in [5, 10] Our mechanism is similar to ....

[Article contains additional citation context not shown here]

Cox P. and Pietrzylowski T., Deduction Plans: A Basis for Intelligent Backtracking, IEEE PAMI, Vol 3, 1981.

....need be created. With primitive determinacy, choice points may still be made and only after evaluating the test goal for a clause would they be removed. A search procedure that detects and then removes many choice points where the unexplored branches do not lead to success is called intelligent [6, 12] or selective backtracking [40] Detection of unnecessary choice points is normally performed at run time during the forward execution [8] If the detection is based on compile time analysis, the backtracking is called semi intelligent [9] A hybrid scheme that relies on both static and run time ....

P.T. Cox and T. Pietrzykowski. Deduction plans: A basis for intelligent backtracking. IEEE PAMI, 3:52--65, 1981.

....most recent choice point during that failure. In other words, alternatives of choice points between the most recent one and the chosen one are discarded without retrying them. If they were retried, the system would have reencountered with that same failure. Many intelligent backtracking schemes [3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15] are presented to avoid unnecessary backtracking steps. Early works in intelligent backtracking [3, 7, 11] are implemented as Prolog interpreters. Implementations of later works [5, 6, 8, 9] are WAM based systems. Our intelligent backtracking schema whose some parts are presented in this paper is ....

....one are discarded without retrying them. If they were retried, the system would have reencountered with that same failure. Many intelligent backtracking schemes [3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15] are presented to avoid unnecessary backtracking steps. Early works in intelligent backtracking [3, 7, 11] are implemented as Prolog interpreters. Implementations of later works [5, 6, 8, 9] are WAM based systems. Our intelligent backtracking schema whose some parts are presented in this paper is implemented as an extension of the WAM same as systems in [5, 8] Our mechanism is similar to mechanisms ....

Cox P. and Pietrzylowski T., Deduction Plans: A Basis for Intelligent Backtracking, IEEE PAMI, Vol 3, 1981.

....any binding applied in g, b) b does not generate any binding, c) the new bindings generated by b does not solve g Intelligent backtracking is used to avoid redundant and futile computation. Intelligent backtracking based on run time bookkeeping has been studied by Cox and Pietrzykowski 1006 [6], Bruynooghe Pereira Porto [5, 7] Chang and Despain [8] and Vipin Kumar [9, 10] These approaches require considerable overhead in time and space. Static or dynamic dependencies among the literals in a rule are used to identify the backtrack literal. Conery [13, 14] was the first to suggest the ....

....be constructed from the gc lists for R. Example Consider the rule r r : p0(X, Y) p1(Y, Z) p2(X) p3(Z) p4(X, Y, U) p5(Z, W) p6(V) p7(X, V) p8(Y) p9(X, U, V) p10(Y, U) p11(X, Z) The gc lists of r are gc(r, X) 2, 4, 7, 9, 11] gc(r, U) 4, 9, 10] gc(r, Y) 1, 4, 8, 10] gc(r, V) [6, 7, 9] gc(r, Z) 1, 3, 5, 11] gc(r, W) 5] Now, consider an application r of r obtained by the unification of the goal g = p0(X , X ) to the head(r) Therefore, the gc lists of r are gc(r , X) gc(r, X) Union gc(r, Y) 1, 2, 4, 7, 8, 9, 10, 11] 1016 gc(r , Y) gc(r, X) Union gc(r, Y) 1, ....

Cox, P., Pietrzylowski, T., "Deduction Plans: A basis for Intelligent Backtracking", IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-3, 1981.

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