Fetching the paper…
Reading the bibliography…
In this paper, we present Demystify, a general tool for creating human-interpretable step-by-step explanations of how to solve a wide range of pen and paper puzzles from a high-level logical description.
Algèbres de Lie libres et monoïdes libres
Viennot, G. (1974) · 1974
Earlier work this paper cites.
Explanation-based generalisation of failures
de Siqueira N., J. L., and Puget, J. (1988) · 1988
Earlier work this paper cites.
The complexity of facets resolved
Papadimitriou, C. H., and Wolfe, D. (1988) · 1988
Earlier work this paper cites.
Locating minimal infeasible constraint sets in linear programs
Chinneck, J. W., and Dravnieks, E. W. (1991) · 1991
Earlier work this paper cites.
Some practicable filtering techniques for the constraint satisfaction problem
Debruyne, R., and Bessière, C. (1997) · 1997
Earlier work this paper cites.
Boosting complete techniques thanks to local search methods
Mazure, B., Sais, L., and Grégoire, É. (1998) · 1998
Earlier work this paper cites.
Generalised arc consistency for the alldifferent constraint: An empirical survey
Gent, I. P., Miguel, I., and Nightingale, P. (2008) · 2000
Earlier work this paper cites.
Quickxplain: Conflict detection for arbitrary constraint propagation algorithms
Junker, U. (2001) · 2001
Earlier work this paper cites.
Conceptis Puzzles
Conceptis (2002) · 2002
Earlier work this paper cites.
Interpolation and sat-based model checking
McMillan, K. L. (2003) · 2003
Earlier work this paper cites.
Krazydad
Bumgardner, J. (2005) · 2005
Earlier work this paper cites.
Sudoku as a constraint problem
Simonis, H. (2005) · 2005
Earlier work this paper cites.
Tectonic Puzzel
Tectonic (2005) · 2005
Earlier work this paper cites.
A scalable algorithm for minimal unsatisfiable core extraction
Dershowitz, N., Hanna, Z., and Nadel, A. (2006) · 2006
Earlier work this paper cites.
Learning abstractions for model checking
Gupta, A. (2002) · 2006
Earlier work this paper cites.
Extracting mucs from constraint networks
Hemery, F., Lecoutre, C., Sais, L., and Boussemart, F. (2006) · 2006
Earlier work this paper cites.
Handbook of Constraint Programming
Rossi, F., van Beek, P., and Walsh, T. (Eds.). (2006) · 2006
Cited alongside, same era.
How to solve sudoku : a step-by-step guide
Wilson, R. J. (2006) · 2006
Cited alongside, same era.
Sudoku creation and grading
Stuart, A. C. (2007) · 2007
Cited alongside, same era.
Essence: A constraint language for specifying combinatorial problems
Frisch, A. M., Harvey, W., Jefferson, C., Martínez-Hernández, B., and Miguel, I. (2008) · 2008
Cited alongside, same era.
A survey of np-complete puzzles
Kendall, G., Parkes, A., and Spoerer, K. (2008) · 2008
Cited alongside, same era.
Sudoku Wiki
Stuart, A. (2008) · 2008
Cited alongside, same era.
Logic Masters India
India, L. M. (2010) · 2010
Difficulty rating of sudoku puzzles: An overview and evaluation
Pelánek, R. (2014) · 2014
Later among the works it cites.
Using minimal correction sets to more efficiently compute minimal unsatisfiable sets
Bacchus, F., and Katsirelos, G. (2015) · 2015
Later among the works it cites.
Innoludic
Innoludic (2015) · 2015
Later among the works it cites.
Debugging unsatisfiable constraint models
Leo, K., and Tack, G. (2017) · 2017
Later among the works it cites.
Automatically improving constraint models in Savile Row
Nightingale, P., Akgün, Ö., Gent, I. P., Jefferson, C., Miguel, I., and Spracklen, P. (2017) · 2017
Later among the works it cites.
On the glucose SAT solver
Audemard, G., and Simon, L. (2018) · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Minimal Unsatisfiability: Models, Algorithms and Applications (Invited Paper)
Silva, J. P. M. (2010) · 2010
Cited alongside, same era.
Computing small unsatisfiable cores in satisfiability modulo theories
Cimatti, A., Griggio, A., and Sebastiani, R. (2011) · 2011
Cited alongside, same era.
Difficulty rating of sudoku puzzles by a computational model
Pelánek, R. (2011) · 2011
Cited alongside, same era.
The Logical World of Puzzles
Rao, R. (2011) · 2011
Cited alongside, same era.
Muser2: An efficient MUS extractor
Belov, A., and Marques-Silva, J. (2012) · 2012
Cited alongside, same era.
Explaining explanations: An overview of interpretability of machine learning
Gilpin, L. H., Bau, D., Yuan, B. Z., Bajwa, A., Specter, M., and Kagal, L. (2018) · 2018
Later among the works it cites.
Kakuro.com
Kakuro.com (2019) · 2019
Later among the works it cites.
Step-wise explanations of constraint satisfaction problems
Bogaerts, B., Gamba, E., Claes, J., and Guns, T. (2020) · 2020
Later among the works it cites.
Sudoku Dragon - Strategy Guide
Senn, M. (2020) · 2020
Later among the works it cites.
Puzzled man solving ’miracle’ sudoku becomes youtube sensation.
Usborne, S. (2020) · 2020
Later among the works it cites.
Handbook of Satisfiability - Second Edition
Biere, A., Heule, M., van Maaren, H., and Walsh, T. (Eds.). (2021) · 2021
Closest in time.
Futoshiki.org
Futoshiki.org (2021) · 2021
Closest in time.
Conjure: Automatic Generation of Constraint Models from Problem Specifications
Akgün, Ö., Frisch, A. M., Gent, I. P., Jefferson, C., Miguel, I., and Nightingale, P. (2022) · 2022
Closest in time.
Understanding how people approach constraint modelling and solving
Hoffmann, R., Zhu, X., Akgün, Ö., and Nacenta, M. A. (2022) · 2022
Closest in time.
Kakuros.org
Kakuros.org (2022) · 2022
Closest in time.