Algorithms for generating ordered solutions for explicit AND/OR structures: extended abstract

Authors:
Priyankar Ghosh;Amit Sharma;P. P. Chakrabarti;Pallab Dasgupta
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, WB, India;Department of Computer Science, Cornell University, Ithaca, NY;Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, WB, India;Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, WB, India
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 13
Cited 0

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving
Principles of artificial intelligence

Principles of artificial intelligence
Increasing search efficiency using multiple heuristics

Information Processing Letters
Finding the k Shortest Paths

SIAM Journal on Computing
An efficient algorithm for finding the M most probable configurationsin probabilistic expert systems

Statistics and Computing
Finding the k Smallest Spanning Trees

SWAT '90 Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory
AND/OR search spaces for graphical models

Artificial Intelligence
Approximate Solution Sampling (and Counting) on AND/OR Spaces

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
An Incremental Graph-based Approach to Automatic Service Composition

SCC '08 Proceedings of the 2008 IEEE International Conference on Services Computing - Volume 1
Weighted A∗ search -- unifying view and application

Artificial Intelligence
Additive AND/OR graphs

IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Bucket and mini-bucket schemes for m best solutions over graphical models

GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
Algorithms for generating ordered solutions for explicit and/or structures

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.