]> 2012-05-28T00:39:36-04:00 Brahms Medha Presentation 0918 Joshua Taylor Question 2 The authors do not seem to cite the particular depth-first search that they are using, but it does not seem to compare well with their bi-directional breadth first search. Is there any indication of whether they are using a straightforward depth first search versus an iterative deepening search (as discussed by, e.g., Russell and Norvig in "Artificial Intelligence: A Modern Approach")? On a related note, the authors mention in their "Future Work" section that they plan on experimenting with languages for expressing regular paths. This suggests that they recognize some predicates and resources as more interesting than others. They have developed an efficient RDF store for performing graph based search algorithms, and seem to have a notion of cost, or benefit, on the edges and nodes of the graph—why do they not mention using heuristic algorithms? Tw:Brahms Medha Presentation 0918 Question for the Presentation Joshua A. Taylor Question asked by Question asked Presentation Questions