Hanus, MichaelPeemöller, BjörnReck, FabianJähnichen, StefanRumpe, BernhardSchlingloff, Holger2018-11-192018-11-192012978-3-88579-293-2https://dl.gi.de/handle/20.500.12116/18376In this paper we discuss our practical experiences with the use of different search strategies in functional logic programs. In particular, we show that complete strategies, like breadth-first search or iterative deepening search, are a viable alternative to incomplete strategies, like depth-first search, that have been favored in the past for logic programming languages.enText/Conference Paper1617-5468