POLYNOMIAL 3-SAT REDUCTION OF SUDOKU PUZZLE
Main Article Content
Abstract
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.
References
Marques Silva J., Malik S., “Propositional SAT Solvingâ€, In: Clarke E., Henzinger T., Veith H., Bloem R. (eds) Handbook of Model Checking, Springer, Cham, pp. 247-275, 2018.
Claessen, Koen, N. Een, M. Sheeran, N. Sorensson, “SAT-Solving in Practiceâ€, 9th IEEE International Conference on Discrete Event Systems, pp. 61-67, 2008.
A.K. Maji, R.K. Pal, “Sudoku Solver using Minigrid Based Backtrackingâ€, IEEE International Conference on Advance Computing (IACC), pp. 36-44, 2014.
Perez, Meir, TshilidziMarwala, “Stochastic Optimization Approaches for Solving Sudokuâ€, Archives of Neural and Evolutionary Computing, Cornell University Library, 2008.
Deng, Xiu Qin, Yong Da Li., “A Novel Hybrid Genetic Algorithm for Solving Sudoku Puzzlesâ€, Springer Journal of Optimization Letters, Vol. 7, No. 2, pp. 241-257, 2013.
Bartlett, Andrew C., Amy N. Langville, “An Integer Programming Model for the Sudoku Problemâ€, Journal of Online Mathematics and its Applications, Vol. 8, Article ID 1798, 2008.
Ines Lynce, Joel Ouaknine, “Sudoku as a SAT Problemâ€, Proceedings of 9th International Symposium on Artificial Intelligence and Mathematics, 2006.
Prakash C.Sharma and Narendra S. Chaudhari, “A Graph Coloring Approach for Channel Assignment in Cellular Network via Propositional Satisfiabilityâ€, International Conference on Emerging Trends in Networks and Computer Communications (ETNCC) at Udaipur, pp. 23-26, 2011.
N.Dahale, N.S.Chaudhari, M. Ingle, “Determining Vertex Cover Using Polynomial Encoding of 3satâ€, VNSGU Journal of Science and Technology, Vol. 4, No. 1, pp. 197-204, 2015.
Prakash C. Sharma and Narendra S. Chaudhari, “Polynomial 3-SAT Encoding for K-Colorability of Graphâ€, Evolution in Networks and Computer Communications-A Special Issue from IJCA, Article 4, No. 1, pp. 19-24, 2011.
Tovey, Craig A., “A simplified NP-complete satisfiability problemâ€,Discrete Applied Mathematics, Elsevier, Vol. 8, No. 1,pp. 85-89, 1984.
N. Chandrasekaran, K.L.P Mishra, “Theory of Computer Scienceâ€, PHI Learning publishing, 3rd edition, 2011.
Felgenhauer, Bertram, Frazer Jarvis, “Mathematics of Sudoku-Iâ€, Mathematical Spectrum, Vol. 39, No. 1, pp. 15-22, 2006.
G. Kendall, A.J. Parkes, K. Spoerer, “A Survey of NP-Complete Puzzlesâ€, International Computer Games Association (ICGA) Journal, Vol.31, No. 1, pp. 13-34, 2008