Nondeterministic Programming in Java

In this paper, we show how nondeterministic programming techniques can be used within the Java programming language. Our proposal is to stay within a library-based approach but taking advantage of the (nondeterministic) con-straint solver provided by the library JSetL to give the user the possibility to define its own nondeterministic code as new constraints. We also point out the potential synergy between nondeterminism and sets and between nondetermin-ism and constraint programming. We support our claims by showing concrete Java implementations of a number of different examples ranging from classical combinatorial problems to list operations, and from graph-based problems to implementing Definite Clause Grammars.