Izvorni znanstveni članak
Modeling and solving self-referential puzzles
Maja Bubalo
; Faculty of Pedagogy, University of Osijek, Osijek, Croatia
Mirko Čubrilo
; Faculty of Organization and Informatics, University of Zagreb, Varaždin, Croatia
Sažetak
The so-called self-referential puzzles are a very interesting kind of logic puzzles, aiming at developing the skill of logical thinking. A self-referential puzzle consists of a sequence of questions about the puzzle itself. In this paper, we shall show some selfreferential puzzles, demonstrate how to model and solve them as propositional logic problems, and how to mechanically generate new puzzles. For this, we shall make use of the specific advantages of Mozart/Oz system – the finite domain constraint programming language and environment.
We shall also show some new puzzles, according to our best knowledge not yet published elsewhere. The program in Mozart/Oz using our method generated these puzzles.
Ključne riječi
self-referential puzzles; logic programming; finite domain constraint programming; Mozart/Oz
Hrčak ID:
78211
URI
Datum izdavanja:
15.6.2005.
Posjeta: 4.049 *