@InProceedings{Henz:1996,
AUTHOR = {Henz, Martin},
TITLE = {Don't Be Puzzled!},
YEAR = {1996},
BOOKTITLE = {Workshop on Constraint Programming Applications: An Inventory and Taxonomy. In conjunction with the 2nd International Conference on Principles and Practice of Constraint Programming (CP '96), August 19},
ADDRESS = {Cambridge, Massachusetts, USA},
URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/puzzle96.ps.gz},
ABSTRACT = {This paper is about how to solve a class of puzzles, called self-referential quizzes ( extitsrq), with constraint programming. An extitsrq is a sequence of multiple choice questions that are about the puzzle itself. extitsrqs are an attractive pastime, when they provide the possibility of drawing non-trivial conclusions on the way to the solution. We introduce a typical extitsrq, and represent it as a propositional satisfiability problem. Its straightforward clausal representation is too big for effective treatment using standard methods. Instead, we solve it with finite domain constraint programming. For this application of constraint programming, support of logic connectives such as conjunction and disjunction is crucial. With their small problem descriptions, extitsrqs are ideal candidates for benchmarks covering the implementation of 0/1 variables in constraint programming languages.},
ANNOTE = {COLIURL : Henz:1996:DP.pdf Henz:1996:DP.ps}
}
|
