|3/2016 - 13|
Back to Basics: Solving Games with SATQUER, S.
|Click to see author's profile on SCOPUS, IEEE Xplore, Web of Science|
|Download PDF (1,045 KB) | Citation | Downloads: 87 | Views: 270|
artificial intelligence, algorithm design and analysis, boolean algebra, formal verification, partitioning algorithms
satisfiability(7), verification(4), solving(4), intelligence(4), design(4), artificial(4), aided(4)
Blue keywords are present in both the references section and the paper title.
About this article
Date of Publication: 2016-08-31
Volume 16, Issue 3, Year 2016, On page(s): 91 - 98
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2016.03013
Web of Science Accession Number: 000384750000013
SCOPUS ID: 84991056316
Games became popular, within the formal verification community, after their application to automatic synthesis of circuits from specifications, and they have been receiving more and more attention since then. This paper focuses on coding the Sokoban puzzle, i.e., a very complex single-player strategy game. We show how its solution can be encoded and represented as a Bounded Model Checking problem, and then solved with a SAT solver. After that, to cope with very complex instances of the game, we propose two different ad-hoc divide-and-conquer strategies. Those strategies, somehow similar to state-of-the-art abstraction-and-refinement schemes, are able to decompose deep Bounded Model Checking instances into easier subtasks, trading-off between efficiency and completeness. We analyze a vast set of difficult hard-to-solve benchmark games, trying to push forward the applicability of state-of-the-art SAT solvers in the field. Those results show that games may provide one of the next frontier for the SAT community.
|References|||||Cited By «-- Click to see who has cited this paper|
| A. Church, "Logic, arithmetic, and automata," International congress of mathematicians, Djursholm, Sweden, pp. 23-35, August 1963. |
 P. J. G. Ramadge and W. M. Wonham, "The control of discrete event systems," Proceeding of the IEEE, 77(1), pp. 81-98, January 1989.
[CrossRef] [Web of Science Times Cited 1160] [SCOPUS Times Cited 1538]
 T. Wolfgang, "Infinite games and verification," in Ed Brinksma and Kim Guldstrand Larsen editors, in Proceedings of the Computer Aided Verification Confernce (CAV), London, UK, Springer, pp. 58-64, September 2002.
 H. Kautz and B. Selman, "Planning as satisfiability," in Proceedings of the 10th European Conference on Artificial Intelligence (ECAI’92), Vienna, Austria, John Wiley & Sons Inc. publisher, New York, NY, USA, pp. 359-363, 1992. ISBN: 0-471-93608-1
 W. Thomas, "Infinite games and verification," in Ed Brinksma and Kim Guldstrand Larsen editors, in Proceedings of the Computer Aided Verification Conference (CAV), volume 2102 of LNCS, Springer-Verlag, Copenhagen, Denmark, pp. 58-64, July 2002.
 R. Alur, P. Madhusudan, and W. Nam, "Symbolic computational techniques for solving games," International Journal on Software Tools for Technology Transfer (STTT), pp. 118-128, January 2005.
[CrossRef] [SCOPUS Times Cited 4]
 I. P. Gent and A. G. D. Rowley, "Encoding connect-4 using quantified Boolean formulae," in Proceedings of the 2nd International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, Kinsale, Ireland, pp. 78-93, 2003.
 C. Ansotegui, C. P. Gomes, and B. Selman, "The Achilles' heel of QBF," in Proceedings of the 20th National Conference on Artificial Intelligence (AAAI’05), Pittsburg, Pennsylvania, AAAI Press, pp. 275-281. July 2005. ISBN: 1-57735-236-x.
 I. Lynce and J. Ouaknine, "Sudoku as a SAT problem," in Proceedings of the 9th International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, January 2006.
 A. Sabharwal, C. Ansňtegui, C. P. Gomes, J. W. Hart, and B. Selman, "QBF modeling: exploiting player symmetry for simplicity and efficiency," in Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing (SAT’06), volume 4121 of LNCS, Springer-Verlag, Seattle, Washington, pp. 382-395, August 2006.
 J. P. Marques-Silva and K. A. Sakallah, "GRASP - a new search algorithm for satisfiability," in Proceedings of the International Conference on Computer Aided Design (ICCAD), November 1996.
 H. Jin and F. Somenzi, "CirCUs: a hybrid satisfiability solver," in Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing, Vancouver, BC, Canada, May 2004.
 T. Walsh, C. Thiffault, and F. Bacchus, "Solving non-clausal formulas with DPLL search," in Proceedings of the International Conference on Theory and Applications of Satisfiability Testing, volume 2919 of LNCS, Springer-Verlag, pp. 663-678, 2004.
 L. Zhang, "Solving QBF with combined conjunctive and disjunctive normal form," in Proceedings of the 21th National Conference on Artificial Intelligence (AAAI’06), Boston, Massachusetts, AAAI Press, pp. 143-149, 2006. ISBN: 978-1-57735-281-5.
 A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu, " Symbolic model checking using SAT procedures instead of BDDs," in Proceedings of the 36th Design Automation Conference, New Orleans, Louisiana, IEEE Computer Society, pp. 317-320, June 1999.
 J. Whittemore, J. Kim, and K. Sakallah, "SATIRE: a new incremental satisfiability engine," in Proceedings of the 38th Design Automation Conference, New York, NY, USA, ACM Press, pp. 542-545, June 2001. ISBN: 1-58113-297-2.
 N. Een and N. Sorensson, "Temporal induction by incremental SAT solving," in First International Workshop on Bounded Model Checking (BMC’03), Boulder, Colorado, pp. 58-64, July 2003.
[CrossRef] [SCOPUS Times Cited 144]
 H. Cho, G. D. Hatchel, E. Macii, B. Plessier, and F. Somenzi, "Algorithms for approximate FSM traversal based on state space decomposition," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 15(12), pp. 1465-1478, 1996.
[CrossRef] [Web of Science Times Cited 26] [SCOPUS Times Cited 32]
Web of Science® Citations for all references: 1,186 TCR
SCOPUS® Citations for all references: 1,718 TCR
Web of Science® Average Citations per reference: 62 ACR
SCOPUS® Average Citations per reference: 90 ACR
TCR = Total Citations for References / ACR = Average Citations per Reference
We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more
Citations for references background updated on 2017-02-19 15:14 in 103 seconds.
Note1: Web of Science® is a registered trademark of Thomson Reuters.
Note2: SCOPUS® is a registered trademark of Elsevier B.V.
Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.