Skip Navigation

The Computer Journal 1987 30(2):183-188; doi:10.1093/comjnl/30.2.183
© 1987 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (7)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Berghel, H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Crossword Compilation with Horn Clauses

H. Berghel *

Department of Computer Science, University of Arkansas, Fayetteville, AR 72701, USA

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.

Received November 1985.

* Department of Computer Science, University of Arkansas, Fayetteville, AR 72701, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.