Discovery and Uncertainty in Semantic Web Services

Although Semantic Web service discovery has been extensively studied in the literature ([1], [2], [3] and [4]), we are far from achieving an effective, complete and automated discovery process. Using the Incidence Calculus [5], a truth-functional probabilistic calculus, and a lightweight brokering mechanism [6], this article explores the suitability of integrating probabilistic reasoning in Semantic Web services environments. We show how the combination of relaxation of the matching process and evaluation of Web service capabilities based on previous performances of Web service providers enables new possibilities in service discovery.

[1]  Takahiro Kawamura,et al.  Semantic Matching of Web Services Capabilities , 2002, SEMWEB.

[2]  Thomas Lukasiewicz,et al.  P-SHOQ(D): A Probabilistic Extension of SHOQ(D) for Probabilistic Ontologies in the Semantic Web , 2002, JELIA.

[3]  Ian Horrocks,et al.  Description logic programs: combining logic programs with description logic , 2003, WWW '03.

[4]  Dieter Fensel,et al.  UPML: A Framework for Knowledge System Reuse , 1999, IJCAI.

[5]  Leon Sterling,et al.  The art of Prolog (2nd ed.): advanced programming techniques , 1994 .

[6]  David Stuart Robertson,et al.  Matchmaking multi-party interactions using historical performance data , 2005, AAMAS '05.

[7]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[8]  David Robertson,et al.  Matchmaking and Brokering Multi-Party Interactions Using Historical Performance Data , 2005 .

[9]  Pavel Klinov.  Pronto: A Non-monotonic Probabilistic Description Logic Reasoner , 2008, ESWC.

[10]  Yarden Katz,et al.  Pellet: A practical OWL-DL reasoner , 2007, J. Web Semant..

[11]  Leon Sterling,et al.  The Art of Prolog , 1987, IEEE Expert.

[12]  Alan Bundy.  Incidence Calculus ∗ , 2010 .

[13]  Wamberto Weber Vasconcelos,et al.  A Lightweight Capability Communication Mechanism , 2000, IEA/AIE.

[14]  Leon Sterling,et al.  The Art of Prolog - Advanced Programming Techniques, 2nd Ed , 1986 .

[15]  Michael Kifer,et al.  WSMO Web Service Discovery , 2004 .

[16]  Katia P. Sycara,et al.  Middle-Agents for the Internet , 1997, IJCAI.

[17]  Timothy W. Finin,et al.  KQML as an agent communication language , 1994, CIKM '94.

[18]  J. Gonzalez-Castillo,et al.  Description logics for matchmaking of services , 2001 .

[19]  Ian Horrocks,et al.  A software framework for matchmaking based on semantic web technology , 2003, WWW '03.

[20]  Alan Bundy,et al.  Eco-Logic - Logic-Based Approaches to Ecological Modeling , 1991, Logic programming.

[21]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[22]  Matthias Klusch,et al.  Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace , 2002, Autonomous Agents and Multi-Agent Systems.

[23]  D. Robertson.  A Lightweight Method for Coordination of Agent Oriented Web Services ∗ , 2004 .

[24]  Dieter Fensel,et al.  The Unified Problem-Solving Method Development Language UPML , 2003, Knowl. Inf. Syst..

[25]  David Stuart Robertson,et al.  A Lightweight Coordination Calculus for Agent Systems , 2004, DALT.