Change search
Refine search result
1 - 37 of 37
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the 'Create feeds' function.
  • 1.
    Haseeb, Abdul
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Kungas, Peep
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Semantic Middleware for Robot Swarm Interaction through Web Services2008In: MIC Special Session on Computing Systems in Dynamic Environments / [ed] L. Bruzzone, 2008Conference paper (Refereed)
    Abstract [en]

    In this paper we propose a semantic middleware architecture and communication support for environments with swarm robots. Our main assumption is that robots can communicate via wireless networks while we don't assume high processing power in the robots. Basic advantage of the proposed middleware is the extension of robots' capabilities via access to semantic information and powerful processing engines. The architecture is conformant with main standard solutions and allows reusing intelligent functionality implemented in the external world.

  • 2.
    Haseeb, Abdul
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Küngas, Peep
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Mediator-based Distributed Web Services Discovery and Invocation for Infrastructure-less Mobile Dynamic Systems2008In: proceedings of 4th International IEEE Conference of Next generation Web services practices (NWeSP.08), 2008, p. 46-53Conference paper (Refereed)
    Abstract [en]

    Mobile autonomous systems like robot swarms or mobile software agents operate in a dynamic environment pertaining self-organization, self configurationand heterogeneity of computing entities.In such settings there is a need for autonomicpublishing and discovery of resources and just-in-timeintegration for on-the-fly service consumption withoutany a priori knowledge of available services both withinthe execution environment and from the outsideworld. We propose a mediator-based distributed Webservices discovery and invocation middleware.Moreover we present experimental results on animplemented robot swarm simulation environment. Wepropose a conceptual classification of computingentities on the basis of communication capabilities andconceptual overlay formation for query propagation.Our approach provides a loose coupling in terms ofspace and time and uses both Internet-basedcommunication and RDF-based communication viamessages mediators/post-boxes between entities wheninter-communication between entities is not possible.

  • 3.
    Haseeb, Abdul
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Kungas, Peep
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    DeLP Based Semantic Location Lattice for Intelligent Robotic Navigation2008In: Proceedings of the 2008 International Conference on Artificial Intelligence, ICAI 2008 and Proceedings of the 2008 International Conference on Machine Learning; Models, Technologies and Applications / [ed] H. Arabnia et al, 2008, p. 686-692Conference paper (Refereed)
    Abstract [en]

    Location models require a well-defined representation of spatial connectivity and hierarchical relationship between different spatial concepts; and are fundamental for location navigation, location based services and contextual query responses. Current location models rely on a priori knowledge of surrounding environment and mostly the semantics of relationships are over-looked. In this paper we propose an incremental semantic spatial relationship building approach for robotic agents based on formal concept analysis and defeasible reasoning. We consider a number of cases in which an autonomous robot with incomplete information about the environment can perform reasoning and update its location navigation. We use contextual information for establishing strength of partial order relationship between discovered concepts of robotic navigation/computing environment.

  • 4.
    Haseeb, Abdul
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Kungas, Peep
    Distributed and Passive Web services discovery middleware for Pervasive services at the edges of Internet2010In: Second International Conferences on Advanced Service Computing SERVICE COMPUTATION, 2010Conference paper (Refereed)
  • 5.
    Haseeb, Abdul
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Kungas, Peep
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Light-Weight Decentralized Autonomic Web Service Discovery for Systems with Heterogeneous Communication Capabilities2008In: the proceedings of 12th IASTED International Conference on Internet and Multimedia Systems and Applications (IMSA.08) / [ed] M. Mandal, 2008, p. 7-18Conference paper (Refereed)
    Abstract [en]

    Interoperability between autonomous systems like robot swarm or mobile software agents rely on efficient and seamless communication. Such mobile and dynamic environments pertain self-organization and self configuration of computing entities, a need for autonomic publishing and discovery of resources, and communication from and to outside world. Furthermore, such systems are attributed by heterogeneous communication capabilities of various computing entities. We take Web services approach for robot swarm based on robotic communication capabilities and propose a collaborative and decentralized services discovery and management middleware. Our approach provides a loose coupling in terms of space and time and uses both Internet based communication and RFID tags as message post boxes/relays for communication between robots when communication over the Internet is not available.

  • 6.
    Haseeb, Abdul
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Küngas, Peep
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Distributed Discovery and Invocation of Web Services in Infrastructure-less Dynamic Environments2009In: International Journal of Web Services Practices (IJWSP), ISSN 1738-6535, Journal of Web Services Practices, ISSN 1738-6535, Vol. 3, no 3-4, p. 171-184Article in journal (Refereed)
    Abstract [en]

    Mobile autonomous systems like robot swarms or mobile software agents operate in a dynamic environment pertaining self-organization, selfconfiguration and heterogeneity of computing entities. In such settings there is a need for autonomic publishing and discovery of resources and just-in-time integration for on-the-fly service consumption without any a priori knowledge of available services both within the execution environment and from the outside world. We propose a mediator-based distributed Web services discovery and invocation middleware. Moreover we present experimental results on an implemented robot swarm simulation environment. We propose a conceptual classification of computing entities on the basis of communication capabilities and conceptual overlay formation for query propagation. Our approach provides a loose coupling in terms of space and time and uses both Internet-based communication and RDF-based communication via messages mediators/post-boxes between entities when inter-communication between entities is not possible.

  • 7. Kungas, Peep
    et al.
    Dumas, Marlon
    Mokarizadeh, Shahab
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Analyzing Web Services Networks: Theory and Practice2014In: Advanced Web Services / [ed] Athman Bouguettaya,Quan Z. Sheng, Florian Daniel, New York: Springer-Verlag New York, 2014, p. 381-406Chapter in book (Refereed)
    Abstract [en]

    This paper addresses the problem of applying the general network theory for analyzing qualitatively Web services networks. The paper reviews current approaches to analyzing Web services networks, generalizes the published approaches into a formal framework for analyzing Web services networks and demonstrates its applicability in practice. More specifically, two case studies are described where the presented framework has been applied. The first one considers identification of redundant data in large-scale service-oriented information systems, while the second one measures information diffusion between individual information systems.

  • 8. Kungas, Peep
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Combining Symbolic and Non-Symbolic Negotiation for Agent-Based Web Service Composition2005In: Proceedings of the 2005 International Conference on Artificial Intelligence ICAI'05, CSREA Press, 2005, p. 513-519Conference paper (Refereed)
    Abstract [en]

    The paper presents an architecture and a methodology for agent-based Web service discovery and composition. We assume that Web services are described in DAML-S. Since DAML-S represents declarative information about services, symbolic reasoning can be applied for search or composition of new services automatically. We propose the usage of symbolic agent negotiation for dynamic Web service discovery and composition, while nonsymbolic negotiation is applied for negotiating over the cost or other attributes of the composite service. Therefore, by using symbolic negotiation for automated service composition, we support declarative information gathering and integration during service composition, whilst non-symbolic negotiation facilitates pragmatic issues of Web service execution.

  • 9. Kungas, Peep
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Detection of Missing Web Services: The Partial Deduction Approach2005In: International Journal of Web Services Practices (IJWSP), ISSN 1738-6535, Vol. 1, no 1-2, p. 133-141Article in journal (Refereed)
  • 10. Kungas, Peep
    et al.
    Matskin, Mihhail
    Norwegian Univ Sci & Technol, Dept Comp & Informat Sci, N-7034 Trondheim, Norway.
    Detection of Missing Web Services: The Partial Deduction Approach2005In: Proceedings of International Conference on Next Generation Web Services Practices, NWeSP'05, IEEE Computer Society, 2005, p. 339-344Conference paper (Refereed)
    Abstract [en]

    Many methods have been recently proposed for composing automatically Web services from existing ones. The methods range from AI planning to automated theorem proving and graph search algorithms. However the usability of these methods is greatly affected by two assumptions. Firstly, it is assumed that developers provide consistent declarative descriptions of Web services. Secondly, it is assumed that there exists a sufficient set of atomic Web services, which would facilitate the composition of all other Web services. In this paper we propose a method to ensure these two assumptions by using analysis of Web services' descriptions. In particular we apply partial deduction for identifying possible inconsistencies in Web service descriptions. Our method also determines possibly missing atomic Web services, which should be implemented in order to compose a requested composite Web service.

  • 11.
    Kungas, Peep
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    From web services annotation and composition to web services domain analysis2007In: International Journal of Metadata, Semantics and Ontologies, ISSN 1744-2621, E-ISSN 1744-263X, Vol. 2, no 3, p. 157-178Article in journal (Refereed)
    Abstract [en]

    Automated web service annotation and composition are seen as complimentary technologies. While automated annotation allows to extract web service semantics from existing WSDL documents, automated composition uses this semantics for integrating applications. Anyway, automated composition can be applied not only to constructing new but also to analysis of existent web services. Therefore applicability of both methodologies is essential for increasing the productivity of information system integration. In this paper we propose application of automated composition for analysing web services domains. We identify and analyse some general web services properties in the context of industrial and public web services.

  • 12.
    Kungas, Peep
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Interaction and Potential Synergy between Commercial and Governmental Web Services:  a Case Study2007In: SERVICES 2007, Proceedings of 2007 IEEE Congress on Services, 2007, p. 1-8Conference paper (Refereed)
    Abstract [en]

    Recent progress in the field of Web services has resulted in deployment of a significant number of Web services. Furthermore, it is expected that the number of available Web services will constantly grow in the following years. Due to the high number of available Web services, it is a hard task for developers and business analysts to choose which Web services are most suitable for integration. However, despite the increased academic and commercial interest to Web services, there is currently no survey available analysing most relevant Web services. Moreover, to the best of our knowledge, there is no publicly available study analysing the structure and potential synergy between commercial and governmental Web services. In this paper we target these shortcomings by providing a case study of automated Web service composition for semantically annotated commercial and governmental Web services. We propose a method for identifying most applicable Web services and demonstrate it on a case study. We also analyse interaction and potential synergy between commercial and governmental Web services.

  • 13. Kungas, Peep
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Linear logic, partial deduction and cooperative problem solving2004In: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 2990, p. 263-279Article in journal (Refereed)
    Abstract [en]

    In this paper we present a model of cooperative problem solving (CPS). Linear Logic (LL) is used for encoding agents' states, goals and capabilities. LL theorem proving is applied by each agent to determine whether the particular agent is capable of solving the problem alone. If no individual solution can be constructed, then the agent may start negotiation with other agents in order to find a cooperative solution. Partial deduction in LL is used to derive a possible deal. Finally proofs are generated and plans are extracted from the proofs. The extracted plans determine agents' responsibilities in cooperative solutions.

  • 14. Kungas, Peep
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Partial Deduction for assisting Automated Semantic Web Service Composition2005In: Proceedings of the Workshop on Exploring Planning and Scheduling for Web Services, Grid and Autonomic Computing held in conjunction with The Twentieth National Conference on Artificial Intelligence , (AAAI 2005), 2005, p. 43-45Conference paper (Refereed)
  • 15. Kungas, Peep
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Partial deduction for linear logic - The symbolic negotiation perspective2005In: Agents and Peer-To-Peer Computing / [ed] Leite, J; Omicini, A; Torroni, P; Yolum, P, BERLIN: SPRINGER , 2005, Vol. 3476, p. 35-52Conference paper (Refereed)
    Abstract [en]

    Symbolic negotiation is regarded in the field of computer science as a process, where parties try to reach an agreement on the high-level means for achieving their goals by applying symbolic reasoning techniques. It has been proposed [1] that symbolic negotiation could be formalised as Partial Deduction (PD) in Linear Logic (LL). However, the paper [1] did not provided a formalisation of the PD process in LL. In this paper we fill the gap by providing a formalisation of PD for !-Horn fragment of LL. The framework can be easily extended for other fragments of LL as well such that more comprehensive aspects of negotiation can be described. In this paper we consider also soundness and completeness of the formalism. It turns out that, given a certain PD procedure, PD for LL in !-Horn fragment is sound and complete. We adopt the hypothesis that an essential component of symbolic negotiation is Cooperative Problem Solving (CPS). Thus a formal system for symbolic negotiation would consist of CPS rules plus negotiationspecific rules. In this paper only CPS rules are under investigation while negotiation-specific rules shall be published in another paper.

  • 16. Kungas, Peep
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Semantic Web Service Composition through a P2P-Based Multi-Agent Environment2005In: Proceedings of the Fourth International Workshop on Agents and Peer-to-Peer Computing (AP2PC 2005) in conjunction with AAMAS 2005, 2005Conference paper (Refereed)
    Abstract [en]

    This paper describes a multi agent system (MAS) for distributed composition of Semantic Web services. Since our system is intended to function in highly dynamic environments, where heterogeneous agents rapidly join and leave the system, we consider P2P approach as most suitable for facilitating agent and service discovery. The MAS is based on Chord P2P network, which allows the MAS to dynamically publish and locate available Semantic Web services, which are specified with OWL-S. In order to compose new Web services from existing ones, agents apply symbolic reasoning in a cooperative problem solving manner.

  • 17.
    Kungas, Peep
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Symbolic Negotiation: Partial Deduction for Linear Logic with Coalition Formation2008In: Web Intelligence and Agent Systems, ISSN 1570-1263, E-ISSN 1875-9289, Vol. 6, no 2, p. 193-215Article in journal (Refereed)
    Abstract [en]

    In this paper we present a formalism for symbolic negotiation while regarding symbolic negotiation as cooperative problem solving (CPS). CPS is based on symbolic reasoning and is extended with negotiation and coalition formation rules. We formalize partial deduction for intuitionistic linear logic and use it as a foundation for formalization of symbolic negotiation. We also formalize the process of coalition formation and analyse its effect to symbolic negotiation and CPS. Soundness and compleness proofs for the proposed formalisms are given.

  • 18.
    Kungas, Peep
    et al.
    Norwegian University of Science and Technology, Department of Computer and Information Science, Trondheim, Norway.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Symbolic Negotiation Revisited2006In: Proceedings of Fifth International Joint Conference on Autonomous Agents and Multi-Agent Systems, 2006, p. 432-434Conference paper (Refereed)
    Abstract [en]

    In this paper we propose a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is extended with negotiation-specific rules. The underlying CPS formalism was previously presented in [3]. Here we extend the results and position symbolic negotiation according to other distributed problem solving mechanisms.

  • 19. Kungas, Peep
    et al.
    Matskin, Mihhail
    KTH, Superseded Departments, Microelectronics and Information Technology, IMIT.
    Symbolic Negotiation with Linear Logic2004In: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, ISSN 0302-9743, Vol. 3259, p. 71-88Article in journal (Refereed)
    Abstract [en]

    Negotiation over resources and multi-agent planning are important issues in multi-agent systems research. Previously it has been demonstrated [18] how symbolic negotiation and distributed planning together could be formalised as distributed Linear Logic (LL) theorem proving. LL has been chosen mainly because of its expressive power for representation of resources and its computation-oriented nature. This paper extends the previous work by taking advantage of a richer fragment of LL and introducing two sorts of nondeterministic choices into negotiation. This allows agents to reason and negotiate under certain degree of uncertainty. Additionally, a way of granting unbounded access to resources during negotiation is considered. Finally we extend our framework with first-order LL for expressing more complex offers during negotiation.

  • 20. Kungas, Peep
    et al.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Web services analysis: Making use of web service composition and annotation2006In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) / [ed] Mizoguchi, R; Shi, Z; Giunchiglia, F, 2006, Vol. 4185, p. 501-515Conference paper (Refereed)
    Abstract [en]

    Automated Web service composition and automated Web service annotation could be seen as complimentary methodologies. While automated annotation allows to extract Web service semantics from existing WSDL documents, automated composition uses this semantics for integrating applications. Therefore applicability of both methodologies is essential for increasing the productivity of information system integration. Although several papers have proposed methods for automated annotation, there is a lack of studies providing analysis of the general structure of Web services. We argue that having an overview of general Web services structures would greatly improve design of new annotation methods. At the same time, progress in automated composition has resulted in several methods for automating Web services orchestration. In this paper we propose application of automated composition also for analysing Web services domain. We identify and analyse some general Web services properties and provide their interpretation in an industrial context.

  • 21.
    Kungas, Peep
    et al.
    Norwegian University of Science and Technology, Department of Computer and Information Science, Trondheim, Norway.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Web Services Roadmap: The Semantic Web Perspective2006In: Proceedings of International Conference on Internet and Web Applications and Services, ICIW'06, IEEE Computer Society, 2006, p. 130-Conference paper (Refereed)
    Abstract [en]

    Recentlythefield ofWebserviceshas gained focus both in industry and academia. While industry has been mostly interested in standardisation and promotion ofthetechnology, academia has been looking for ways to fitthetechnology into other frameworks, such astheSemanticWeb. Anyway, despite oftheincreased academic and commercial interest toWebservices, there are currently only few case studies available aboutWebservicesintheSemanticWebcontext. Moreover, according to authors' knowledge, there is no publicly available study analysing which data is currently mostly provided/required byWebservices. In this paper we target these shortcomings by providing a case study of semantically annotated commercial and governmentalWebservices. We analyse interaction and potential synergy between commercial and governmentalWebservices. Alsotherole ontologies forsemanticintegration ofWebservicesis analysed. Moreover, we identifythemost common data exploited by currentWebservices.

  • 22. Kungas, Peep
    et al.
    Rao, J
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Symbolic agent negotiation for semantic web service exploitation2004In: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 3129, p. 458-467Article in journal (Refereed)
    Abstract [en]

    This paper presents an architecture and a methodology for agent-based Web service discovery and composition. We assume that Web services are described with declarative specifications like DAML-S. Based on the declarative information about services, symbolic reasoning can be applied while searching for or composing automatically new services. We propose that symbolic agent negotiation could be used for dynamic Web service discovery and composition. Symbolic negotiation, as we consider it here, is a mixture of distributed planning and information exchange. Therefore, by using symbolic negotiation for automated service composition, we support information collection and integration during service composition. The latter aspect has been largely neglected in automated service composition until now.

  • 23.
    Küngas, Peep
    et al.
    Norwegian University of Science and Technology, Trondheim, Norway .
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Symbolic negotiation in linear logic with coalition formation2006In: 2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, Proceedings / [ed] Nishida, T; Klusch, M; Sycara, K; Yokoo, M; Liu, J; Wah, B; Cheung, W; Cheung, YM, IEEE Computer Society, 2006, p. 298-305Conference paper (Refereed)
    Abstract [en]

    In this paper we present a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is extended with negotiation-specific rules. The underlying CPS formalism based on linear logic was previously presented in [7]. Here we extend the formalism with symbolic negotiation and coalition formation rules. Moreover, we position symbolic negotiation regarding other distributed problem solving mechanisms. Although there exist currently several formalisms for symbolic negotiation, none of them seems to involve coalition formation.

  • 24.
    Liu, Shenghua
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Küngas, Peep
    Norwegian University of Science and Technology (NTNU).
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Agent-Based Web Service Composition with JADE and JXTA2006In: Proceedings of The 2006 International Conference on Semantic Web and Web Services, SWWS'06, 2006, p. 110-116Conference paper (Refereed)
    Abstract [en]

    Rapid development of the Internet and increasing number of available Web services has generated a need for tools and environments facilitating automated composition of atomic Web services into more complex Web processes. JADE is an agent development environment where Web services and agents can be linked together to enable semantic Web applications. However, the current JADE message transportation protocols do not allow agent communication through firewalls and network address translators (NAT-s). Fortunately, the firewall/NAT issue can be solved by using the current JXTA implementation for agent communication. In this paper we describe our efforts to incorporate JXTA protocols into JADE for facilitating inter-agent communication over the Internet. We also describe the design and implementation of an agent-based Web service composition environment, where service registration and discovery are resolved using the JXTA advertisements..By combining the capabilities of JADE and JXTA, agent-based Web service applications can be supported in JADE at a higher level of abstraction.

  • 25. Maigre, R.
    et al.
    Grigorenko, P.
    Küngas, Peep
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Tyugu, E.
    Stratified composition of web services2008Conference paper (Refereed)
    Abstract [en]

    We propose an automatic service composition methodology where, three levels of composition knowledge are distinguished: user level, logical level and implementation level knowledge. We use a knowledge-based software development environment CoCoViLa that enables composition throughout these three levels. A motivation for this approach is a need to overcome the complexity of service composition on very large sets of atomic services we are dealing with in our application domain. The domain concerns federated governmental information systems.

  • 26. Maigre, Riina
    et al.
    Küngas, Peep
    SOA Trader, Ltd, Tallinn, Estonia.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Tyugu, Enn
    Dynamic Service Synthesis on a Large Service Models of a Federated Governmental Information System2009In: International Journal on Advances in Intelligent Systems, ISSN 1942-2679, Vol. 2, no 1, p. 181-191Article in journal (Other academic)
    Abstract [en]

    In this paper we describe our experiments with largesyntactic Web service models of a federated governmentalinformation system for automatic composition of services.The paper describes a method for handling syntactic servicemodels for synthesis of compound services. The method’simplementation as a visual tool developed in software environmentCoCoViLa is explained on an example from egovernmentdomain. Given a specification and a goal, thetool automatically synthesizes a program that generates arequired composite service description in BPEL or OWL-S.

  • 27. Maigre, Riina
    et al.
    Küngas, Peep
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Tyugu, Enn
    Handling Large Web Services Models in a Federated Governmental Information System2008In: Proceedings - 3rd International Conference on Internet and Web Applications and Services, ICIW 2008 / [ed] Mellouk, A; Bi, J; Ortiz, G; Chiu, DKW; Popescu, M, IEEE , 2008, p. 626-631Conference paper (Refereed)
    Abstract [en]

    Experiments with large service models of a federated governmental information system are described. Large syntactic Web service models are being used for automatic composition of services in an e-government information system. A visual tool developed in software environment CoCoViLa has been used for handling syntactic service models and synthesis of compound services. For a given specification and a goal, the tool synthesizes a program that generates a service description in OWL-S and BPEL.

  • 28.
    Matskin, Mihhail
    et al.
    Norwegian University of Science and Technology.
    Küngas, Peep
    Norwegian University of Science and Technology.
    Rao, Jinghai
    Petersen, Sobah
    Enabling Web Services Composition with Software Agents2005In: Proceedings of the Ninth IASTED International Conference on Internet and Multimedia Systems and Applications / [ed] Hamza, MH, ACTA Press, 2005, p. 93-98Conference paper (Refereed)
    Abstract [en]

    We describe our solution to pro-active Web services selection and composition. In particular, we consider a logic-based method for services composition and marketplace-based system architecture supporting agent communication, negotiation and semantic reasoning in the composition process. Usage of agents allows supporting pro-activeness and autonomy of the composition process where both parties - customers and providers - can play an active role via autonomous operation and negotiation. The proposed architecture allows sufficient flexibility and extensibility in developing different solutions while providing a good set of default tools. In this paper we are focusing on our general conceptual solution to the problem of enabling Web services composition with software agents while for technical details and particular developed methods we refer to our other publications.

  • 29.
    Mokarizadeh, Shahab
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Dokoohaki, Nima
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Küngas, Peep
    Trust and Privacy Enabled Service Composition using Social Experience2010In: 10th IFIP International Conference on e-business,e-services and e-society (I3E), Springer, 2010, p. 226-236Conference paper (Refereed)
    Abstract [en]

    In this paper, we present a framework for automatic selection andcomposition of services which exploits trustworthiness of services as a metric formeasuring the quality of service composition. Trustworthiness is defined in terms ofservice reputation extracted from user profiles. The profiles are, in particular, extractedand inferred from a social network which accumulates users past experience withcorresponding services. Using our privacy inference model we, first, prune socialnetwork to hide privacy sensitive contents and, then, utilize a trust inference basedalgorithm to measure reputation score of each individual service, and subsequentlytrustworthiness of their composition

  • 30.
    Mokarizadeh, Shahab
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Grosso, Alberto
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Kungas, Peep
    Haseeb, Abdul
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Applying Semantic Web Service Composition for Action Planning in Multi-Robot Systems2009In: 2009 FOURTH INTERNATIONAL CONFERENCE ON INTERNET AND WEB APPLICATIONS AND SERVICES / [ed] Sasaki H, Bellot GO, Ehmann M, Dini O, NEW YORK: IEEE , 2009, p. 370-376Conference paper (Refereed)
    Abstract [en]

    In this paper we demonstrate how the Web services based solutions can be effectively utilized and integrated into robotic world. In particular, we consider robotic systems where overall control is not embedded into any of the robots and the local behavior of each robot is loosely dependent on behavior of other robots. We propose an architecture for swarm action planning based on Web services paradigm exploiting a problem ontology for service discovery, linear logic based service composition for action planning and a task allocation layer for finding the most suitable robot to perform an action. In our solution all entities in the system expose their functionalities as Web services and allow dynamic service discovery and selection.

  • 31.
    Mokarizadeh, Shahab
    et al.
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Kungas, Peep
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    A framework for evaluating semantic annotations of Web services: A network theory based approach for measuring annotation quality2014In: Web Intelligence and Agent Systems, ISSN 1570-1263, E-ISSN 1875-9289, Vol. 12, no 1, p. 15-34Article in journal (Refereed)
    Abstract [en]

    In the past years various methods have been developed which require semantic annotations of Web services as an input. Such methods typically leverage discovery, match-making, composition and execution of Web services in dynamic settings. At the same time a number of automated Web service annotation approaches have been proposed for enabling application of these methods in settings where it is not feasible to provide the annotations manually. However, lack of effective automated evaluation frameworks has seriously limited proper assessment of the constructed annotations in settings where the overall annotation quality of large quantities of Web services needs to be evaluated. This paper describes an evaluation framework for measuring the quality of semantic annotations for a large number of real-world Web services from heterogeneous application domains. The evaluation framework is generally based on analyzing properties of Web service networks constructed from semantic annotations of the Web services. More specifically, we measure scale-free, small-world and correlation degree properties of the networks to evaluate the overall quality of annotations. The evaluation is demonstrated using annotations constructed semi-automatically for a set of publicly available WSDL documents containing descriptions of about 200 000 Web service operations.

  • 32.
    Mokarizadeh, Shahab
    et al.
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Kungas, Peep
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Ontology acquisition from web service descriptions2013In: Proceedings of the 28th Annual ACM Symposium on Applied Computing, SAC '13, Coimbra, Portugal, March 18-22, 2013. ACM 2013 9 / [ed] Sung Y. Shin, José Carlos Maldonado (Eds), 2013, p. 325-332Conference paper (Refereed)
    Abstract [en]

    The lack of formally expressed semantics in web services complemented with the increasing number of available web services is the main obstacle in analyzing and using the existing web services exposed in the Web. In the absence of appropriate reference domain ontology, annotation of existing web services is dependent on ontology development and ontology learning techniques. In this paper we present an unsupervised ontology learning approach tailored to learning from WSDL documents. The most specific feature of the suggested approach is that it constructs (semi-) automatically ontology fragments from a collection of WSDL documents, that lack any extra textual documentation, by just exploiting element names in the WSDL document. The suggested approach combines both linguistic and statistic analysis techniques such as lexico-syntactic patterns and term co-occurrence analysis. The preliminary results show that the generated ontology captures correctly more than half of the semantic classes and instances as well as taxonomic and non-taxonomic relations, hence, providing a reasonable basis for automatic web services annotation.

  • 33.
    Mokarizadeh, Shahab
    et al.
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Kungas, Peep
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
    Utilizing Web Services Networks for Web Service Innovation2014In: / [ed] David De Roure, Bhavani Thuraisingham, Jia Zhang, IEEE Communications Society, 2014, p. 646-653Conference paper (Refereed)
    Abstract [en]

    The increasing presence and adoption of Web services on the Web has promoted the significance of management of new service development for service developing sectors. The major challenge is that how to find missing but potentially valuable Web services to be developed. This problem can be divided into two sub-problems: finding missing Web services and measuring the added-value of the introduced services. This paper addresses a plausible solution to the first sub problem. Given a collection of Web services, we propose a framework for suggesting a set of candidate Web services that can be introduced to the collection. These suggested services are novel and do not present in the given collection. Our solution relies on the network structure of Web services for finding and recommending new Web services and utilizes the already observed properties of Web services networks for collective evaluation of the suggested services. The proposed solution is evaluated using 753 semantically annotated Web services. The experimental results shows that the proposed framework provides web service community with new network driven methods for finding and evaluation of new Web services.

  • 34.
    Mokarizadeh, Shahab
    et al.
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Küngas, Peep
    University of Tartu.
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
    Ontology Learning for Cost-Effective Large-Scale Semantic Annotation of Web Service Interfaces2010In: Knowledge Engineering and Management by the Masses, EKAW 2010, Springer Berlin/Heidelberg, 2010, p. 401-410Conference paper (Refereed)
    Abstract [en]

    In this paper we introduce a novel unsupervised ontology learning approach, which can be used to automatically derive a reference ontology from a corpus of web services for annotating semantically the Web services in the absence of a core ontology. Our approach relies on shallow parsing technique from natural language processing in order to identify grammatical patterns of web service message element/part names and exploit them in construction of the ontology. The generated ontology is further enriched by introducing relationships between similar concepts. The experimental results on a set of global Web services indicate that the proposed ontology learning approach generates an ontology, which can be used to automatically annotate around 52% of element part and field names in a large corpus of heterogeneous Web services.

  • 35. Rao, J. H.
    et al.
    Kungas, Peep
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Composition of semantic web services using linear logic theorem proving2006In: Information Systems, ISSN 0306-4379, E-ISSN 1873-6076, Vol. 31, no 05-4, p. 340-360Article in journal (Refereed)
    Abstract [en]

    This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses a Semantic Web service language (DAML-S) for external presentation of Web services, while, internally, the services are presented by extralogical axioms and proofs in LL. LL, as a resource conscious logic, enables us to capture the concurrent features of Web services formally (including parameters, states and non-functional attributes). We use a process calculus to present the process model of the composite service. The process calculus is attached to the LL inference rules in the style of type theory. Thus, the process model for a composite service can be generated directly from the complete proof. We introduce a set of subtyping rules that defines a valid dataflow for composite services. The subtyping rules that are used for semantic reasoning are presented with LL inference figures. We propose a system architecture where the DAML-S Translator, LL Theorem Prover and Semantic Reasoner can operate together. This architecture has been implemented in Java.

  • 36. Rao, Jinghai
    et al.
    Kungas, Peep
    Matskin, Mihhail
    KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
    Application of Linear Logic to Web Service Composition2003In: Proceedings of the First International Conference on Web Services, ICWS'2003, CSREA Press, 2003Conference paper (Refereed)
  • 37. Rao, Jinghai
    et al.
    Kungas, Peep
    Department of Computer Science, Norwegian Univ. Sci. and Technology.
    Matskin, Mihhail
    KTH, Superseded Departments, Microelectronics and Information Technology, IMIT.
    Logic-based web services composition: From service description to process model2004In: IEEE INTERNATIONAL CONFERENCE ON WEB SERVICES, PROCEEDINGS, IEEE Computer Society, 2004, p. 446-453Conference paper (Refereed)
    Abstract [en]

    This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses Semantic Web service language (DAML-S) for external presentation of Web services, while, internally, the services are presented by extralogical axioms and proofs in LL. We use a process calculus to present the composite service formally. The process calculus is attached to the LL inference rules in the style of type theory. Thus the process model for a composite service can be generated directly from the proof. The subtyping rules that are used for semantic reasoning are presented with LL inference figures. We propose a system architecture where the DAML-S translator the LL theorem prover and the semantic reasoner can operate together to fulfill the task. This architecture has been implemented in Java.

1 - 37 of 37
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf