J. Cohen. Non-deterministic algorithms. ACM Computing Surveys, 11(2):79--94, 1979.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....programming, can be amalgamated in a natural way with the imperative programming paradigm. Also, it shows that some algorithmic problems can be solved in a simpler way when drawing on both programming paradigms. 10.1 Related Work A departure point for our considerations was the work of Cohen [1979], who surveys some simple primitives for nondeterministic programming within the imperative programming framework. These primitives involve a nondeterministic choice, here adopted as an ORELSE statement, a parameterized nondeterministic choice, here adopted as a SOME state Alma 0: An Imperative ....

Cohen, J. 1979. Non-Deterministic algorithms. ACM Comput. Surv. 11, 2, 79--94.

....list used when replaying the log, causes its oldest value to be restored last. Therefore, the singly linked list is actually essential to the correct functioning of the log administration system. 38 10. Conclusions 10.1 Related Work A departure point for our considerations was the work of Cohen (1979), who surveys some simple primitives for nondeterministic programming within the imperative programming framework. These primitives involve a nondeterministic choice, here adopted as an ORELSE statement, a parameterized nondeterministic choice, here adopted as a SOME statement, and the failure ....

Cohen, J. (1979), `Non-Deterministic algorithms', ACM Computing Surveys 11(2), 79--94.

....variables. 150 F.4 There are 34 ways for a b, only 3 for b a. 152 F.5 The area of possible configurations. 154 xiv Chapter 1 Introduction CHAPTER 1. INTRODUCTION 2 1. 1 Systematicity Backtracking [9, 28, 50] is a simple and intuitive algorithm for systematically exploring a set of alternatives in search of one or all solutions to a problem. The algorithm is said to be systematic because it considers all of the alternatives in the set and it never considers any one of them more than once [40] ....

J. Cohen. Non-deterministic algorithms. Computing Surveys, 2(2), 1979. BIBLIOGRAPHY 156

....2 98 times altogether. This type of pathology, in which the search algorithm repeatedly fails for the same reason, is sometimes referred to as thrashing. It would be more efficient to check the constraints immediately after each variable is assigned a value, and this is what backtracking does [8, 12, 17, 46, 55, 84]. The only difference between the backtracking algorithm in Figure 1.2 and the exhaustive search algorithm in Figure 1.1 is in the location of the consistency check. After assigning a value to a variable on line 7, Backtracking checks at once (on line 8) whether the partial assignment still ....

....Baumert [46] and Bitner and Reingold [8] provided early surveys of backtracking. Knuth [55] gives a good introduction to backtracking, and he discusses a stochastic method for estimating the size of the backtrack search tree. For a modern survey of backtracking, the reader might consult [12] or [17]. We should note that backtracking is useful for more than constraint satisfaction problems. It is applicable on any search problem for which there is an easily computed predicate on partial solutions that can be used to prune some of those partial solutions that cannot be extended to full ....

[Article contains additional citation context not shown here]

Jacques Cohen. Non-deterministic algorithms. Computing Surveys, 11(2):79--94, 1979.

....form of nondeterminism used is usually called don t know nondeterminism. According to it some path in the computation tree should lead to a correct outcome. There have been some efforts to incorporate this form of nondeterminism into the imperative programming paradigm. For early references see [ Cohen, 1979 ] More recent examples are the languages Icon of [ Griswold and Griswold, 1983 ] and SETL of [ Schwartz et al. 1986 ] In [ Apt et al. 1998 ] we pursued this approach to programming by proposing another, simple, imperative language Alma 0 that supports this form nondeterminism. Our ....

J. Cohen. Non-Deterministic algorithms. ACM Computing Surveys, 11(2):79--94, 1979.

....by anybody familiar with the basics of an imperative language. Moreover, the proposed additions can be naturally incorporated into most of the programming languages supporting the imperative programming paradigm. 1. 2 Related Work A departure point for our considerations is the work of Cohen (1979), who surveys some simple primitives for nondeterministic programming within the imperative programming framework. These primitives involve a nondeterministic choice, here adopted as an OR statement, a parameterized nondeterministic choice, here adopted as a SOME statement, and the failure and ....

....of guarded commands and backtracking, to the primitives of our language. As to the implementation, which is still in a preliminary phase, there are essentially two options: either to translate the programs into deterministic programs (here Modula 2 programs) an approach already discussed in Cohen (1979), or to compile them into a WAM like abstract machine an approach followed by McAloon Tretkoff (1995) The features defined in Section 5 (e.g. generalized equality) require some special machinery. In particular, to account for the notion of known value it is necessary for each type to put ....

Cohen, J. (1979), `Non-Deterministic algorithms', ACM Computing Surveys 11(2), 79--94.

No context found.

J. Cohen, Non-Deterministic Algorithms, Computing Surveys, vol. 11, no. 2, June, 1979, pp. 79-94.

No context found.

J. Cohen. Non-deterministic algorithms. ACM Computing Surveys, 11(2):79--94, 1979.

No context found.

J. Cohen, `Non-deterministic algorithms', Computing Surveys, 11, (2), 79--94 (1979).

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