Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
On the hardness of approximate reasoning
Artificial Intelligence
Proverb: the probabilistic cruciverbalist
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Belief Propagation and Revision in Networks with Loops
Belief Propagation and Revision in Networks with Loops
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Turbo decoding as an instance of Pearl's “belief propagation” algorithm
IEEE Journal on Selected Areas in Communications
Proverb: the probabilistic cruciverbalist
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
A probabilistic approach to solving crossword puzzles
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
An Empirical Study of Probabilistic Arc Consistency
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Review: Computer Language Games
CG '00 Revised Papers from the Second International Conference on Computers and Games
Toward a framework for assembling broken pottery vessels
Eighteenth national conference on Artificial intelligence
Prioritised fuzzy constraint satisfaction problems: axioms, instantiation and validation
Fuzzy Sets and Systems - Theme: Multicriteria decision
Proceedings of the 2003 ACM symposium on Applied computing
AutoFeed: an unsupervised learning system for generating webfeeds
Proceedings of the 3rd international conference on Knowledge capture
Solving Crossword Puzzles Using Extended Potts Model
New Frontiers in Artificial Intelligence
Overview of autofeed: an unsupervised learning system for generating webfeeds
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
WebCrow: a WEB-based system for crossword solving
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Solving italian crosswords using the web
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Cracking crosswords: the computer challenge
Reasoning, Action and Interaction in AI Theories and Systems
Hi-index | 0.00 |
Crossword puzzle solving is a classic constraint satisfaction problem, but, when solving a real puzzle, the mapping from clues to variable domains is not perfectly crisp. At best, clues induce a probability distribution over viable targets, which must somehow be respected along with the constraints of the puzzle. Motivated by this type of problem, we describe a formal model of constraint satisfaction with probabilistic preferences on variable values. Two natural optimization problems are defined for this model: maximizing the probability of a correct solution, and maximizing the number of correct words (variable values) in the solution. To the latter, we apply an efficient iterative approximation equivalent to turbo decoding and present results on a collection of real and artificial crossword puzzles.