Algorithms for Generating Ordered Solutions for Explicit AND/OR Structures: Extended Abstract / 3156
Priyankar Ghosh, Amit Sharma, P. P. Chakrabarti, Pallab Dasgupta

We present algorithms for generating alternative solutions for explicit acyclic AND/OR structures in non-decreasing order of cost. Our algorithms use a best first search technique and report the solutions using an implicit representation ordered by cost. Experiments on randomly constructed AND/OR DAGs and problem domains including matrix chain multiplication, finding the secondary structure of RNA, etc, show that the proposed algorithms perform favorably to the existing approach in terms of time and space.