Last update: Thu Sep 27 02:46:46 MDT 2018
@Article{Bagchi:1983:AHS,
author = "A. Bagchi and A. Mahanti",
title = "Admissible heuristic search in {AND\slash OR} graphs",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "2",
pages = "207--219",
month = jul,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence)",
corpsource = "Indian Inst. of Management, Calcutta, India",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "AND/OR graphs; artificial intelligence; heuristic
problem solving; heuristic programming; heuristic
search; HS",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}