Type-aware web service composition using boolean satisfiability solver

Proceedings - 10th IEEE Joint Conference on E-Commerce Technology and the 5th Enterprise Computing, E-Commerce and E-Services, CEC 2008 and EEE 2008

Volumn , Issue , 2008, Pages 331-334

  Nam, Wonhong ^a   Kil, Hyunyoung ^a   Lee, Dongwon ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN SATISFIABILITY; BOOLEAN SATISFIABILITY PROBLEMS; NOVEL SOLUTIONS; OPTIMAL COMPOSITIONS; REACHABILITY PROBLEMS; SEMANTIC FEATURES; SHORTEST PATHS; STATE-TRANSITION SYSTEMS; SUPERTYPE; WEB SERVICE COMPOSITIONS; WEB SERVICE DESCRIPTIONS;

BOOLEAN FUNCTIONS; CHEMICAL ANALYSIS; ELECTRONIC COMMERCE; INFORMATION THEORY; OPTIMIZATION; SEMANTICS;

WEB SERVICES;

EID: 57649224815     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CECandEEE.2008.108     Document Type: Conference Paper

References (14)

1. R. Alur, P. Madhusudan, and W. Nam. Symbolic computational techniques for solving games. STTT, 7(2):118-128, 2005.
2. D. Berre, O. Roussel, and L. Simon. The International SAT Competitions. http://www.satcompetition.org/.
3. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In TACAS, pages 193-207, 1999.
4. M. B. Blake, W. K.-W. Cheung, M. C. Jaeger, and A. Wombacher. WSC-07: Evolving the web services challenge. In CEC/EEE, pages 505-508, 2007.
5. E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample- guided abstraction refinement. In CAV, pages 154- 169, 2000.
6. E. Clarke, O. Grumberg, and D. Peled. Model checking. MIT Press, 2000.
7. H. Kautz and B. Selman. Pushing the envelope: Planning, propo- sitional logic, and stochastic search. In AAAI, pages 1194-1201, 1996.
8. H. Kil, S.-C. Oh, and D. Lee. On the topological landscape of web services matchmaking. In VLDB Workshop on Semantic Matchmaking and Resource Retrieval, 2006.
9. B. Srivastava and J. Koehler. Web service composition: Current solutions and open problems. In ICAPS Workshop on Planning for Web Services, pages 28-35, 2003.
10. S. Oh, D. Lee, and S.R.T. Kumara. Web service planner (WSPR): an effective and scalable web service composition algorithm. JWSR, 4(1):1-23, 2007.
11. S. Oh, J. Yoo, H. Kil, D. Lee, and S.R.T. Kumara. Semantic webservice discovery and composition using flexible parameter matching. In CEC/EEE, pages 533-542, 2007.
12. E. Sirin, B. Parsia, D. Wu, J.A. Hendler, and D.S. Nau. HTN planning for web service composition using SHOP2. J. Web Sem., 1(4):377-396, 2004.
13. L. Xu, F. Hutter, H. H. Hoos, and K. Leyton-Brown. SATzilla-07: The design and analysis of an algorithm portfolio for SAT. In CP, pages 712-727, 2007.
14. L. Zhang and S. Malik. The quest for efficient Boolean satisfiability solvers. In CAV, pages 17-36, 2002.