Symbolic computational techniques for solving games

Electronic Notes in Theoretical Computer Science

Volumn 89, Issue 4, 2003, Pages 578-592

  Madhusudan, P ^a   Nam, Wonhong ^a   Alur, Rajeev ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; DECISION SUPPORT SYSTEMS; ENCODING (SYMBOLS); GRAPHIC METHODS; NETWORKS (CIRCUITS); PROBLEM SOLVING;

BINARY DECISION DIAGRAMS; BOOLEAN FORMULAS; SUBGRAPHS; SYMBOLIC COMPUTATIONAL TECHNIQUES;

GAME THEORY;

EID: 18744371549     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)82544-7     Document Type: Conference Paper

References (25)

1. R. Alur, L. de Alfaro, T. Henzinger, and F. Mang. Automating modular verification. In Proceedings of the Tenth International Conference on Concurrency Theory, volume 1664 in LNCS, Springer, pp. 82-97, 1999.
2. Alur R., Henzinger T.A., Kupferman O. Alternating-time temporal logic. Journal of the ACM. 49:(5):2002;1-42
3. Alur R., Henzinger T.A., Mang F.Y.C., Qadeer S., Rajamani S.K., Tasiran S. MOCHA: Modularity in model checking. In Proceedings of the 10th International Conference on Computer-Aided Verification, volume 1427 of LNCS. 1998;521-525 Springer-Verlag
4. A. Arnold and D. Niwinski. Rudiments of μ-calculus. Studies in Logic and the Foundations of Mathematics 146. 2001.
5. P. Bertoli, A. Cimatti, M. Pistore, M. Roveri, and P. Traverso. MBP: a Model Based Planner. In Proceedings of IJCAI-2001 workshop on Planning under Uncertainty and Incomplete Information, 2001.
6. Biere A., Cimatti A., Clarke E.M., Zhu Y. Symbolic model checking without BDDs. In Tools and Algorithms for the Analysis and Construction of Systems (TACAS′99), volume 1579 in LNCS. 1999;193-207 Springer-Verlag
7. Biere A. μcke - Efficient μ-calculus model checking. In Proceedings of the 9th International Conference on Computer-Aided Verification, volume 1254 of LNCS. 1997;468-471 Springer-Verlag
8. Bryant R.E. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers. 35:(8):1986;677-691
9. Chakrabarti A., de Alfaro L., Henzinger T.A., Jurdzinski M., Mang F.Y.C. Interface compatibility checking for software modules. In Proceedings of the 14th International Conference on Computer-Aided Verification, volume 2404 of LNCS. 2002;428-441 Springer-Verlag
10. Church A. Logic, arithmetics, and automata. In Proc. of the International Congress of Mathematicians, 1962. 1963;23-35 Institut Mittag-Leffler
11. Giunchiglia E., Narizzano M., Tacchella A. QUBE: A system for deciding quantified boolean formulas satisfiability. In Proceedings of the International Joint Conference on Automated Reasoning (IJCAR′01). 2001;364-369
12. E. Goldberg and Y. Novikov. BerkMin: A fast and robust SAT solver. In Proc. of Design Automation and Test in Europe (DATE′02), pages 142-149, 2002.
13. A. Gupta, M. Ganai, C. Wang, Z. Yang, and P.N. Ashar. Learning from BDDs in SAT-based bounded model checking. In Proceedings of the 40th Design Automation Conference (DAC′03), 2003.
14. Jensen R., Veloso M. OBDD-based Universal planning for synchronized agents in non-deterministic domains. Journal of Artificial Intelligence Research. 13:2000;189-226
15. Tommi Junttila. Boolean circuit package version 0.20. http://www.tcs.hut.fi/~tjunttil/circuits/index.html
16. O. Kupferman, and M. Y. Vardi. Module checking. In Proceeding of the 8th International Conference on Computer-Aided Verification, volume 1102 of LNCS, pages 75-86. Springer-Verlag, 1996.
17. Reinhold Lets. Lemma and model caching in decision procedures for quantified boolean formulas. In Proc. of Automated Reasoning with Analytic Tableaux and Related Methods, volume 2381 of LNCS, pages 160-175. Springer-Verlag, 2002.
18. McMillan K.L. Symbolic Model Checking. 1993;Kluwer Academic Publishers
19. K. L. McMillan. Applying SAT methods in unbounded symbolic model checking. In Proceedings of the 14th International Conference on Computer-Aided Verification, volume 2404 of LNCS, pages 250-264. Springer-Verlag, 2002.
20. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference (DAC′01), pages 530-535, 2001.
21. Ramadge P.J.G., Wonham W.M. The control of discrete event systems. Proceedings of the IEEE. 77:1989;81-98
22. J. Rintanen. Improvements to the evaluation of quantified boolean formulae. In Proceedings of the 16th International Joint Conference on Artificial Intelligence, pages 1192-1197, Morgan Kaufmann Publishers, 1999.
23. Rintanen J. Constructing conditional plans by a theorem prover. Journal of Artificial Intelligence Research. 10:1999;323-352
24. W. Thomas Infinite games and verification. In Proceedings of the 14th International Conference on Computer-Aided Verification, volume 2404 of LNCS, pages 58-64. Springer-Verlag, 2002.
25. L. Zhang and S. Malik. Conflict driven learning in a quantified boolean satisfiability solver. In Proceedings of International Conference on Computer Aided Design (ICCAD′02), 2002.