[mod.ai] And/Or graphs

Kenneth.Goldberg@A.GP.CS.CMU.EDU.UUCP (02/13/87)

Two queries concerning And/Or graphs (as opposed to trees):

1)  Has anyone published a thorough survey of And/Or graph search algorithms?

2)  What is the convention regarding And-nodes?  Nilsson (Prob. Solving
	Methods in AI, pp. 87-88) labels those with incoming And-links
	as And-nodes.  Winston (AI, p. 148) and Pearl (Heuristics, p. 25)
	labels those with outgoing And-links as And-nodes.  More importantly,
	is there a convincing argument for either one?