Switch to: Citations

Add references

You must login to add references.
  1. An admissible and optimal algorithm for searching AND/OR graphs.C. L. Chang & J. R. Slagle - 1971 - Artificial Intelligence 2 (2):117-128.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • An analysis of alpha-beta pruning.Donald E. Knuth & Ronald W. Moore - 1975 - Artificial Intelligence 6 (4):293-326.
    Download  
     
    Export citation  
     
    Bookmark   53 citations  
  • Reducing reexpansions in iterative-deepening search by controlling cutoff bounds.U. K. Sarkar, P. P. Chakrabarti, S. Ghose & S. C. De Sarkar - 1991 - Artificial Intelligence 50 (2):207-221.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Linear-space best-first search.Richard E. Korf - 1993 - Artificial Intelligence 62 (1):41-78.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Proof-number search.L. Victor Allis, Maarten van der Meulen & H. Jaap van den Herik - 1994 - Artificial Intelligence 66 (1):91-124.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Agent searching in a tree and the optimality of iterative deepening.Pallab Dasgupta, P. P. Chakrabarti & S. C. DeSarkar - 1994 - Artificial Intelligence 71 (1):195-208.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Conspiracy numbers.Jonathan Schaeffer - 1990 - Artificial Intelligence 43 (1):67-84.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Depth-first iterative-deepening.Richard E. Korf - 1985 - Artificial Intelligence 27 (1):97-109.
    Download  
     
    Export citation  
     
    Bookmark   71 citations  
  • Admissibility of AO∗ when heuristics overestimate.P. P. Chakrabarti, S. Ghose & S. C. DeSarkar - 1987 - Artificial Intelligence 34 (1):97-113.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Best-first fixed-depth minimax algorithms.Aske Plaat, Jonathan Schaeffer, Wim Pijls & Arie de Bruin - 1996 - Artificial Intelligence 87 (1-2):255-293.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Conspiracy numbers for min-max search.David Allen McAllester - 1988 - Artificial Intelligence 35 (3):287-310.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Generalized and/or graphs.Giorgio Levi & Franco Sirovich - 1976 - Artificial Intelligence 7 (3):243-259.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A general branch and bound formulation for understanding and synthesizing and/or tree search procedures.Vipin Kumar & Laveen N. Kanal - 1983 - Artificial Intelligence 21 (1-2):179-198.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search.P. P. Chakrabarti - 1994 - Artificial Intelligence 65 (2):329-345.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-7674574dd6-qscpl uwo