Corpus ID: 101975

Interleaving Discovery and Composition for Simple Workflows

  title={Interleaving Discovery and Composition for Simple Workflows},
  author={O. Lassila and Sapna Dixit},
This paper describes a simple approach for service discovery and composition, where services are described using a subset of the DAML-S ontology. The central idea is to base composition on the mismatch between service discovery queries and their results, and iteratively letting this guide subsequent queries. This approach is a result of work aimed at understanding how much the DAML-S model can be simplified and still be viable for semantic annotation of Web services, specifically when the “use… Expand
Applying Abduction in Semantic Web Service Composition
Making the Difference in Semantic Web Service Composition
Generating Rewrite Rules by Browsing RDF Data
  • O. Lassila
  • Computer Science
  • 2006 Second International Conference on Rules and Rule Markup Languages for the Semantic Web (RuleML'06)
  • 2006
Optimized, decentralized workflow execution in grid environments
Contextualizing applications via semantic middleware
  • O. Lassila, Deepali Khushraj
  • Computer Science
  • The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
  • 2005
A Framework for Dynamic Web Services Composition
Semantic Web Service Composition Based on a Closed World Assumption
Type-Based Composition of Information Services in Large Scale Environments
Towards a Semantic State Transition System for Automated Generation of Data Flow in Web Service Composition


Semantic Matching of Web Services Capabilities
DAML-S: Web Service Description for the Semantic Web
A Software Framework for Matchmaking Based on Semantic Web Technology
Taking the RDF Model Theory Out for a Spin
  • O. Lassila
  • Computer Science
  • International Semantic Web Conference
  • 2002
Enabling Semantic Web Programming by Integrating RDF and Common Lisp
The Semantic Web — ISWC 2002
HTN Planning: Complexity and Expressivity
Serviceoriented computing
  • Communications of the ACM 46(10):25–28.
  • 2003