Abstract
Because of the widespread interest in crossword puzzles, serious attention has been given in recent years toward the development of efficient algorithms for their generation and solution. In this paper we describe a new approach which is based upon an analysis of the problem expressed in first-order predicate logic. This analysis is then used to construct a crossword compiler in Prolog. The kernel of the program is then presented and described.

This publication has 0 references indexed in Scilit: