Skip to main content
Springer Nature Link
Log in

Perfect Hashing for State Spaces in BDD Representation

  • Conference paper
KI 2009: Advances in Artificial Intelligence (KI 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5803))

Included in the following conference series:

  • 1672 Accesses

Abstract

In this paper we design minimum perfect hash functions on the basis of BDDs that represent all reachable states S ⊆ {0,1}n. These functions are one-to-one on S and can be evaluated quite efficiently. Such hash functions are useful to perform search in a bitvector representation of the state space. The time to compute the hash value with standard operations on the BDD G is (n|G|), the time to compute the inverse is O(n 2|G|). When investing O(n) bits per node, we arrive at O(|G|) preprocessing time and optimal time O(n) for ranking and unranking.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Allis, L.V.: A knowledge-based approach to Connect-Four. The game is solved: White wins. Master’s thesis, Vrije Universiteit, The Netherlands (1998)

    Google Scholar 

  2. Ball, M., Holte, R.C.: The compression power of BDDs. In: ICAPS, pp. 2–11 (2008)

    Google Scholar 

  3. Botelho, F.C., Pagh, R., Ziviani, N.: Simple and space-efficient minimal perfect hash functions. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 139–150. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  4. Botelho, F.C., Ziviani, N.: External perfect hashing for very large key sets. In: Conference on Information and Knowledge Management, pp. 653–662 (2007)

    Google Scholar 

  5. Bryant, R.E.: Symbolic manipulation of boolean functions using a graphical representation. In: Design Automation Conference (DAC), pp. 688–694 (1985)

    Google Scholar 

  6. Cooperman, G., Finkelstein, L.: New methods for using Cayley graphs in interconnection networks. Discrete Applied Mathematics 37/38, 95–118 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  7. Culberson, J.C., Schaeffer, J.: Pattern databases. Computational Intelligence 14(4), 318–334 (1998)

    Article  MathSciNet  Google Scholar 

  8. Edelkamp, S., Kissmann, P.: Limits and possibilities of BDDs in state space search. In: AAAI, pp. 46–53 (2008)

    Google Scholar 

  9. Edelkamp, S., Kissmann, P.: Symbolic classification of general two-player games. In: Dengel, A.R., Berns, K., Breuel, T.M., Bomarius, F., Roth-Berghofer, T.R. (eds.) KI 2008. LNCS (LNAI), vol. 5243, pp. 185–192. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Edelkamp, S., Messerschmidt, H., Sulewski, D., Yücel, C.: Solving games in parallel with linear-time perfect hash functions. Technical report, TZI, University of Bremen (2009)

    Google Scholar 

  11. Edelkamp, S., Sanders, P., Simecek, P.: Semi-external LTL model checking. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 530–542. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Edelkamp, S., Sulewski, D.: Flash-efficient LTL model checking with minimal counterexamples. In: Conference on Software Engineering and Formal Methods (SEFM), pp. 73–82 (2008)

    Google Scholar 

  13. Holzmann, G.J., Puri, A.: A minimized automaton representation of reachable states. International Journal on Software Tools for Technology Transfer 2(3), 270–278 (1999)

    Article  MATH  Google Scholar 

  14. Korf, R.E.: Minimizing disk I/O in two-bit-breath-first search. In: AAAI, pp. 317–324 (2008)

    Google Scholar 

  15. Kunkle, D., Cooperman, G.: Twenty-six moves suffice for Rubik’s cube. In: International Symposium on Symbolic and Algebraic Computation (ISSAC), pp. 235–242 (2007)

    Google Scholar 

  16. Love, N.C., Hinrichs, T.L., Genesereth, M.R.: General game playing: Game description language specification. Technical Report LG-2006-01, Stanford Logic Group (2006)

    Google Scholar 

  17. McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Press, Dordrecht (1993)

    Book  MATH  Google Scholar 

  18. Wegener, I.: Branching Programs and Binary Decision Diagrams — Theory and Applications. Society of Industrial and Applied Mathematics (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science and Automation, Technische Universität Ilmenau, P.O. Box 100565, 98684, Ilmenau, Germany

    Martin Dietzfelbinger

  2. TZI, Universität Bremen, Am Fallturm 1, 28357, Bremen, Germany

    Stefan Edelkamp

Authors
  1. Martin Dietzfelbinger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Edelkamp
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. GET Lab, University of Paderborn, Pohlweg 47-49, 33098, Paderborn, Germany

    Bärbel Mertsching , Marcus Hund  & Zaheer Aziz ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dietzfelbinger, M., Edelkamp, S. (2009). Perfect Hashing for State Spaces in BDD Representation. In: Mertsching, B., Hund, M., Aziz, Z. (eds) KI 2009: Advances in Artificial Intelligence. KI 2009. Lecture Notes in Computer Science(), vol 5803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04617-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04617-9_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04616-2

  • Online ISBN: 978-3-642-04617-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics