Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watnot!watmath!clyde!cbatt!ucbvax!A.GP.CS.CMU.EDU!Kenneth.Goldberg
From: Kenneth.Goldberg@A.GP.CS.CMU.EDU.UUCP
Newsgroups: mod.ai
Subject: And/Or graphs
Message-ID: <1987.2.12.22.9.41.Kenneth.Goldberg@a.gp.cs.cmu.edu>
Date: Thu, 12-Feb-87 17:10:44 EST
Article-I.D.: a.1987.2.12.22.9.41.Kenneth.Goldberg
Posted: Thu Feb 12 17:10:44 1987
Date-Received: Wed, 18-Feb-87 22:43:37 EST
Sender: daemon@ucbvax.BERKELEY.EDU
Organization: The ARPA Internet
Lines: 10
Approved: ailist@sri-stripe.arpa


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?