OWL-S atomic services composition with SWRL rules

Authors:
Domenico Redavid;Luigi Iannone;Terry Payne;Giovanni Semeraro
Affiliations:
Dipartimento di Informatica, Università di Bari, Bari, Italy;Computer Science Dept., University of Liverpool, Liverpool UK;School of Electronics and Computer Science, University of Southampton, Southampton, United Kingdom;Dipartimento di Informatica, Università di Bari, Bari, Italy
Venue:
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Year:
2008

Citing 10
Cited 2

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Evolving algebras 1993: Lipari guide

Specification and validation methods
Simulation, verification and automated composition of web services

Proceedings of the 11th international conference on World Wide Web
Semantic Web Services

IEEE Intelligent Systems
Automatic composition of transition-based semantic web services with messaging

VLDB '05 Proceedings of the 31st international conference on Very large data bases
The Description Logic Handbook

The Description Logic Handbook
SHOP2: an HTN planning system

Journal of Artificial Intelligence Research
OWL rules: A proposal and prototype implementation

Web Semantics: Science, Services and Agents on the World Wide Web
Query Answering for OWL-DL with rules

Web Semantics: Science, Services and Agents on the World Wide Web
Expressing business process models as OWL-S ontologies

BPM'06 Proceedings of the 2006 international conference on Business Process Management Workshops

An SPL approach for adaptive fault tolerance in SOA

Proceedings of the 15th International Software Product Line Conference, Volume 2
SWRL rules plan encoding with OWL-S composite services

ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a method for encoding OWL-S atomic processes by means of SWRL rules and composing them using a backward search planning algorithm. A description of the preliminary prototype implementation and a grounding in BPEL are also presented.