OBDDs in heuristic search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1504, Issue , 1998, Pages 81-92

  Edelkamp, Stefan ^a   Reffel, Prank ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; ECONOMIC AND SOCIAL EFFECTS; HEURISTIC ALGORITHMS; MODULAR ROBOTS;

APPLICATION AREA; BINARY ENCODINGS; BREADTH-FIRST SEARCH; HEURISTIC SEARCH; LOWER BOUNDS; SEARCH TREES; SPACE LIMITATIONS; SPACE REQUIREMENTS;

ARTIFICIAL INTELLIGENCE;

EID: 84957698337     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0095430     Document Type: Conference Paper

References (15)

1. A. Biere. Efficient model checking with binary decision diagramms. PhD thesis, Computer Science Department, University of Karlsruhe, 1997.
2. A. Biere. cke - efficient p-calculus model checking. In Computer Aided Verification, volume 1254 of LNCS, pages 468-471, 1997.
3. R. E. Bryant. Symbolic manipulation of boolean functions using a graphical representation. In Proceedings of the 22nd ACM/IEEE Design Automation Conference, pages 688-694, Los Alamitos, Ca., USA, 1985. IEEE Computer Society Press.
4. J. C. Culberson and J. Schaeffer. Searching with pattern databases. In Proceedings of the Eleventh Biennial Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence, volume 1081 of LNAI, pages 402-416, Berlin, 1996. Springer.
5. J. Doppelhamer and JK Lehnert. Optimal solution for sokoban using OBDDs. University of Trier, available from the authors, 1998.
6. J. Eckerle and S. Schuierer. Efficient memory-limited graph search. LNCS, 981:101-112, 1995.
7. P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for heuristic determination of minimum path cost. IEEE Trans, on SSC, 4:100, 1968.
8. A. Junghanns and J. Schaeffer. Single agent search in the presence of deadlocks. To appear in: Proceedings AAAI-98, 1998.
9. A. Junghanns and J. Schaeffer. Sokoban: Evaluating standard single-agent search techniques in the presence of deadlock. To appear in: Proceedings CSCSI-98,Vancouver, Canada, LNCS, Springer, 1998.
10. R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97-109, 1985.
11. R. E. Korf. Finding optimal solutions to Rubik's cube using pattern databases. In Proceedings AAAI-97, pages 700-705. AAAI Press, 1997.
12. R. E. Korf and L. A. Taylor. Finding optimal solutions to the twenty-four puzzle. In Proceedings AAAI-96, pages 1202-1207. AAAI Press, 1996.
13. K. McMillan. Symbolic Model Checking. Kluwer Academic Press, 1993.
14. S. Russell. Efficient memory-bounded search methods. In Proceedings of ECAI-92, pages 1-5. Wiley, 1992.
15. L. A. Taylor and R. E. Korf. Pruning duplicate nodes in depth-first search. In AAAI-93, pages 756-761. AAAI Press, 1993.