Searching for a minimal solution subgraph in explicit AND/OR graphs

Discrete Applied Mathematics

Volumn 110, Issue 2-3, 2001, Pages 213-225

  Hvalica, Dušan ^a  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

AND OR graph; Minimal solution subgraph; Top down search

Indexed keywords

EID: 0035877305     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00271-7     Document Type: Article

References (8)

1. Chakrabarti P.P. Algorithms for searching explicit AND. / OR graphs and their applications to problem reduction search Artificial Intelligence. 65:1994;329-345.
2. Chang C.L., Slagle J.R. An admissible and optimal algorithm for searching AND. / OR graphs Artificial Intelligence. 2(2):1971;117-128.
3. Gallo G., Longo G., Pallottino S., Nguyen S. Directed hypergraphs and applications. Discrete Appl. Math. 42:1993;177-201.
4. Hvalica D. Best first search algorithm in AND. / OR graphs with cycles J Algorithms. 21:1996;102-110.
5. D. Hvalica, Project management and AND / OR graphs, in: T. Hunjak, L. Martić, L. Neralić (Eds.), Proceedings of the sixth International Conference on Operations Research (Croatian Operational Research Society, Rovinj, 1996) pp. 39-42.
6. D. Hvalica, The cost of solution subgraphs in AND / OR graphs modelling projects, in: V. Rupnik, L. Zadnik Stirn, S. Drobne (Eds.), Proceedings of the Fourth International Symposium on Operational Research (Slovenian Society Informatika, Preddvor, 1997) pp. 183-187.
7. Nilsson N.J. Problem-solving Methods in Artificial Intelligence. 1971;McGraw-Hill, New York.
8. L. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, Reading, MA, 1985.