View Publication

Finding Optimal Satisficing Strategies for And-Or Trees

Russ Greiner, Dept of Computing Science; PI of AICML
Ryan Hayward
Magdalena Jankowska
Michael Molloy

Other Attachments:

Many tasks require evaluating a specified Boolean expression φ over a set of probabilistic tests whose costs and success probabilities are each known. A strategy specifies when to perform which test, towards determining the overall outcome of φ. We are interested in finding the strategy with the minimum expected cost.

As this task is typically NP-hard --- for example, when tests can occur many times within φ, or when there are probabilistic correlations between the test outcomes --- it is of interest to consider those cases in which the tests are probabilistically independent and each appears only once in φ. In such cases, φ can be written as an and-or tree, where each internal node corresponds to either the "and" or "or" of its children, and each leaf node is a probabilistic test. In this paper we investigate "probabilistic and-or tree resolution" (PAOTR), namely the problem of finding optimal strategies for and-or trees.

We first consider a depth-first approach, DFA: evaluate each penultimate rooted subtree in isolation, replace each such subtree with a single "mega-test", and recurse on the resulting reduced tree. We show that the strategies produced by this approach are optimal for and-or trees with depth at most two but can be arbitrarily sub-optimal for deeper trees. Each depth-first strategy can be described by giving the linear relative order in which tests are to be executed, with the understanding that any test whose outcome becomes irrelevant is skipped. The class of linear strategies is strictly larger than depth-first strategies. We show that even the best linear strategy can also be arbitrarily sub-optimal.

We next prove that an optimal strategy honours a natural partial order among tests with a common parent node ("leaf-sibling tests"), and use this to produce a dynamic programming algorithm DynPgm that finds the optimal strategy in time O(d² (r+1)^d), where r is the maximum number of leaf-siblings and d is the number of leaf-parents; hence, for trees with a bounded number of internal nodes, this run-time is polynomial in the tree size. We also present another special class of and-or trees for which this task takes polynomial time.

We close by presenting a number of other plausible approaches to PAOTR, together with counterexamples to show their limitations.

Citation

R. Greiner, R. Hayward, M. Jankowska, M. Molloy. "Finding Optimal Satisficing Strategies for And-Or Trees". Artificial Intelligence (AIJ), 170, pp 19-58, January 2006.

Keywords:	And-Or trees, efficient reasoning
Category:	In Journal

BibTeX

@article{Greiner+al:AIJ06,
  author = {Russ Greiner and Ryan Hayward and Magdalena Jankowska and Michael
    Molloy},
  title = {Finding Optimal Satisficing Strategies for And-Or Trees},
  Volume = "170",
  Pages = {19-58},
  journal = {Artificial Intelligence (AIJ)},
  year = 2006,
}

Last Updated: July 18, 2013
Submitted by Russ Greiner

Not Logged In

PapersDB

Finding Optimal Satisficing Strategies for And-Or Trees

Citation

BibTeX