Skip to main content
Log in

Using an extended PROLOG to solve the lion and unicorn puzzle

  • Problem Corner
  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

This paper presents a general approach to solve a constraint satisfaction problem over a finite domain by reducing it to unification in finite algebras. The lion and unicorn puzzle is considered as a constraint satisfaction problem and its implementation in an extended PROLOG is described.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Büttner, W., ‘Implementing Complex Domains of Application in an Extended PROLOG System’, to appear in International Journal of General Systems.

  2. Büttner, W., Estenfeld, K., Schmid, R., Schneider, H. A. and Tiden, Erik, ‘A General Framework for Symbolic Constraint Handling in PROLOG’, Internal Report Siemens AG, Munich.

  3. Ohlbach, H. J. and Schmidt-Schauß, M., ‘The Lion and the Unicorn’, J. Automated Reasoning 1 (3), 327–332 (1985).

    Google Scholar 

  4. Ramsey, B. D., SIGPLAN Notices, 21 (8), (1986).

  5. Smullyan, R., What is the Name of this Book? Prentice-Hall, Engelwood Cliffs, New Jersey (1978). quoted from [3].

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schmid, R., Schneider, HA. & Filkorn, T. Using an extended PROLOG to solve the lion and unicorn puzzle. J Autom Reasoning 5, 403–408 (1989). https://doi.org/10.1007/BF00248326

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00248326

Key words

Navigation