Ordered Solution Generation for Implicit AND/OR Search Spaces

  • Priyankar Ghosh
  • Partha Pratim Chakrabarti
  • Pallab Dasgupta
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8251)

Abstract

In this paper we address the problem of generating alternative solutions for implicit AND/OR DAGs which are described using a start state and a set of transformation rules. Unlike the explicit representation of AND/OR graph, for implicitly specified AND/OR graphs, the transformation rules are used to dynamically make a portion of an AND/OR graph explicit as per requirement. We propose an algorithm, ASGAO*, for generating alternative solutions for implicitly specified AND/OR graphs. Experimental results in several domains show that, on an average, our proposed algorithm performs hundred times better with respect to running time and fifty times better with respect to space than the existing algorithm. In view of the renewed research interest towards applying AND/OR graphs in domains like graphical model, constraint satisfaction, and service composition, it is not hard to see useful applications of ASGAO*.

Keywords

Service Composition Transformation Rule Terminal Node Constraint Satisfaction Heuristic Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Russell, S., Norvig, P.: Planning. In: Artificial Intelligence: A Modern Approach, 2nd edn., pp. 375–461. Prentice-Hall, Englewood Cliffs (2003)Google Scholar
  2. 2.
    Dechter, R., Mateescu, R.: AND/OR search spaces for graphical models. Artif. Intell. 171(2-3), 73–106 (2007)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Lang, Q.A., Su, Y.: AND/OR graph and search algorithm for discovering composite web services. International Journal of Web Services Research 2(4), 46–64 (2005)Google Scholar
  4. 4.
    Ghosh, P., Sharma, A., Chakrabarti, P.P., Dasgupta, P.: Algorithms for generating ordered solutions for explicit AND/OR structures. J. Artif. Intell. Res (JAIR) 44, 275–333 (2012)MathSciNetMATHGoogle Scholar
  5. 5.
    Elliott, P.: Extracting the k best solutions from a valued AND/OR acyclic graph. Master’s thesis, Massachusetts Institute of Technology (2007)Google Scholar
  6. 6.
    Martelli, A., Montanari, U.: Additive AND/OR graphs. In: Proceedings of the 3rd International Joint Conference on Artificial Intelligence, Morgan Kaufmann Publishers Inc., San Francisco (1973)Google Scholar
  7. 7.
    Dasgupta, P., Chakrabarti, P.P., DeSarkar, S.C.: Multiobjective heuristic search in AND/OR graphs. Journal of Algorithms 20(2), 282–311 (1996)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Priyankar Ghosh
    • 1
  • Partha Pratim Chakrabarti
    • 1
  • Pallab Dasgupta
    • 1
  1. 1.Indian Institute of Technology KharagpurIndia

Personalised recommendations