Solving nonograms by combining relaxations

DOI10.1016/j.patcog.2008.12.003zbMath1183.68520WikidataQ56288394 ScholiaQ56288394MaRDI QIDQ1023434

Kees Joost Batenburg, Walter A. Kosters

Publication date: 11 June 2009

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2008.12.003

zbMATH Keywords

discrete tomography; nonograms; 2-SAT; logic reasoning

Mathematics Subject Classification ID

68T10: Pattern recognition, speech recognition

68T37: Reasoning under uncertainty in the context of artificial intelligence

Related Items

Unnamed Item, Improving the performance of evolutionary algorithms in grid-based puzzles resolution, Solving nonograms by combining relaxations, Nonograms: combinatorial questions and algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Reconstructing convex polyominoes from horizontal and vertical projections
• A unified theory of structural tractability for constraint satisfaction problems
• A framework for generating some discrete sets with disjoint components by using uniform distributions
• Solving nonograms by combining relaxations
• Binary vectors partially determined by linear equation systems
• Discrete tomography. Foundations, algorithms, and applications
• The reconstruction of polyominoes from their orthogonal projections
• Reconstruction of convex 2D discrete sets in polynomial time
• A combinatorial problem associated with nonograms
• Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
• Combinatorial Properties of Matrices of Zeros and Ones