.png){kind=icon}
Return
An efficient algorithm for searching implicit AND/OR graphs with cycles
.png){kind=icon}
PRE
AI
DOI：10.1016/S0004-3702(00)00063-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Vile present an efficient AO*-like algorithm that handles cyclic graphs without neither unfolding the cycles nor looping through them. Its top-down search strategy is based on Mahanti and Bagchi's CF [J. ACM 32 (1985) 28], whereas its bottom-up revision process is inspired in Chakrabarti's REP [Artificial Intelligence 65 (1994) 329]. However, important modifications have been introduced in both algorithms to attain a true integration and gain efficiency. Proofs of correctness and completeness are included. Up to our knowledge, the resulting algorithm-called CFCREV*-is the most efficient one available for this problem. (C) 2000 Elsevier Science B.V. All rights reserved.
Keywords:
AND/OR graphs
cyclic graphs
heuristic search
assembly/disassembly problems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveShareSave
ShareSaveShareSave
View more