Search strategies for functional logic programming.
Michael D. Hanus, Björn Peemöller, Fabian Reck · 2012
Abstract: In 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 alterna-tive to incomplete strategies, like depth-first search, that have been favored in the past for logic programming languages. 1