The use of a strategy language for solving search problems

The ELAN language implements computational systems, a concept that combines rewriting logic with a description of strategies. It can be used to specif y and execute non-deterministic rule-based computation for solving various kinds of search problems. This paper presents several examples illustrating different features of the ELAN strategy language from a simple search prob lem to solving constrained search problems. Concurrent strategies and ELAN process control facilities are illustrated by prototyping the cooperation o f solvers.