References

  1. Louis Victor Allis (1994): Searching for Solutions in Games and Artificial Intelligence. Rijksuniversiteit Limburg te Maastricht.
  2. Marcel Ball & Robert C. Holte (2008): The Compression Power of Symbolic Pattern Databases. In: ICAPS, pp. 2–11.
  3. Fabiano C. Botelho, Rasmus Pagh & Nivio Ziviani (2007): Simple and Space-Efficient Minimal Perfect Hash Functions. In: WADS, pp. 139–150, doi:10.1007/978-3-540-73951-7_13.
  4. Teresa M. Breyer & Richard E. Korf (2010): 1.6-Bit Pattern Databases. In: AAAI, pp. 39–44. Available at http://www.aaai.org/ocs/index.php/AAAI/AAAI10/paper/view/1850.
  5. Randal E. Bryant (1985): Symbolic Manipulation of Boolean Functions Using a Graphical Representation. In: 22nd Design Automation Conference (DAC). ACM Press, pp. 688–694, doi:10.1145/317825.317964.
  6. Randal E. Bryant (1986): Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers 35(8), pp. 677–691, doi:10.1109/TC.1986.1676819.
  7. Alessandro Cimatti, Marco Pistore, Marco Roveri & Paolo Traverso (2003): Weak, Strong, and Strong Cyclic Planning via Symbolic Model Checking. Artificial Intelligence 147(1–2), pp. 35–84, doi:10.1016/S0004-3702(02)00374-0.
  8. Martin Dietzfelbinger & Stefan Edelkamp (2009): Perfect Hashing for State Spaces in BDD Representation. In: KI, pp. 33–40, doi:10.1007/978-3-642-04617-9_5.
  9. Stefan Edelkamp & Frank Reffel (1998): OBDDs in Heuristic Search. In: KI, pp. 81–92, doi:10.1007/BFb0095430.
  10. Subramanian Iyer, Debashis Sahoo, E. Allen Emerson & Jawahar Jain (2006): On Partitioning and Symbolic Model Checking. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 25(5), pp. 780–788, doi:10.1109/TCAD.2006.870410.
  11. Rune M. Jensen, Manuela M. Veloso & Randal E. Bryant (2008): State-Set Branching: Leveraging BDDs for Heuristic Search. Artificial Intelligence 172(2-3), pp. 103–139, doi:10.1016/j.artint.2007.05.009.
  12. Peter Kissmann & Stefan Edelkamp (2010): Layer-Abstraction for Symbolically Solving General Two-Player Games.. In: SoCS'10, pp. 63–70.
  13. Richard E. Korf (2008): Minimizing Disk I/O in Two-Bit Breadth-First Search. In: AAAI, pp. 317–324.
  14. Nathaniel C. Love, Timothy L. Hinrichs & Michael R. Genesereth (2006): General Game Playing: Game Description Language Specification. Technical Report LG-2006-01. Stanford Logic Group.
  15. Kenneth L. McMillan (1992): Symbolic Model Checking: An Approach to the State Explosion Problem. Carnegie Mellon University.
  16. Kenneth L. McMillan (1993): Symbolic Model Checking. Kluwer Academic Publishers, doi:10.1007/978-1-4615-3190-6.
  17. Shin-ichi Minato, Nagisa Ishiura & Shuzo Yajima (1990): Shared Binary Decision Diagram with Attributed Edges for Efficient Boolean Function Manipulation. In: DAC. ACM Press, pp. 52–57, doi:10.1109/DAC.1990.114828.
  18. Amit Narayan, Jawahar Jain, M. Fujita & A. Sangiovanni-Vincentelli (1996): Partitioned ROBDDs – A Compact, Canonical and Efficiently Manipulable Representation for Boolean Functions. In: ICCAD, pp. 547–554, doi:10.1109/ICCAD.1996.569909.
  19. John W. Romein & Henri E. Bal (2002): Awari is Solved. International Computer Games Association (ICGA) Journal 25(3), pp. 162–165.
  20. Debashis Sahoo, Subramanian K. Iyer, Jawahar Jain, Christian Stangier, Amit Narayan, David L. Dill & E. Allen Emerson (2004): A Partitioning Methodology for BDD-Based Verification. In: Formal Methods in Computer-Aided Design, pp. 399–413, doi:10.1007/978-3-540-30494-4_28.
  21. Fabio Somenzi (2009): CUDD: CU Decision Diagram Package, Release 2.4.2. Available at http://vlsi.colorado.edu/~fabio/CUDD/.
  22. Bwolen Yang, Randal E. Bryant, David R. O'Hallaron, Armin Biere, Olivier Coudert, Geert Janssen, Rajeev K. Ranjan & Fabio Somenzi (1998): A Performance Study of BDD-Based Model Checking. In: FMCAD, pp. 255–289, doi:10.1007/3-540-49519-3_18.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org