Optimal depth-first strategies for and-or trees

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 725-730

  Greiner, Russell ^a   Hayward, Ryan ^a   Molloy, Michael ^b  

^a UNIVERSITY OF ALBERTA   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Computational complexity; Diagnosis; Satisficing search

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CORRELATION METHODS; COSTS; MATHEMATICAL MODELS; PROBABILITY; THEOREM PROVING; TREES (MATHEMATICS);

BOOLEAN EXPRESSIONS;

ARTIFICIAL INTELLIGENCE;

EID: 0036931188     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. [Bar84] J. Barnett. How much is control knowledge worth?: A primitive example. Artificial Intelligence, 22:77-89, 1984.
2. [Gar73] M. Garey. Optimal task sequencing with precedence constraints. Discrete Mathematics, 4, 1973.
3. [GB91] D. Geiger and J. Barnett. Optimal satisficing tree searches. In Proc, AAAI-91, pages 441-43, 1991.
4. [GHM02] R. Greiner, R. Hayward, and M. Malloy. Optimal depth-first strategies for And-Or trees. Tech. rep, U. Alberta, 2002.
5. [GJ79] M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979.
6. [GO91] R. Greiner and P. Orponen. Probably approximately optimal derivation strategies. In Proc, KR-91, 1991.
7. [GO96] R. Greiner and P. Orponen. Probably approximately optimal satisficing strategies. Artificial Intelligence, 82, 1996.
8. [Gre91] R. Greiner. Finding the optimal derivation strategy in a redundant knowledge base. Artificial Intelligence, 50, 1991.
9. [HR76] L. Hyafil and R. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 35(1):15-17, 1976.
10. [Nat86] K. Natarajan. Optimizing depth-first search of AND-OR trees. Report RC-11842, IBM Watson Research Center, 1986.
11. [Sah74] S. Sahni. Computationally related problems. SIAM Journal on Computing, 3(4):262-279, 1974.
12. [SK75] H. Simon and J. Kadane. Optimal problem-solving search: All-or-none solutions. Artificial Intelligence, 6:235-247, 1975.
13. [Smi89] D. Smith. Controlling backward inference. Artificial Intelligence, 39(2): 145-208, June 1989.