• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.715-726
• /
• 2006

Web service technologies provide a standard means for interoperation and integration of heterogeneous applications distributed over the Internet. For efficient execution of hierarchically interacting composite web services, this paper proposes an approach to distribute web service invocations over peer systems effectively, exploiting intensional XML data embedding external service calls as a result of well services. A cost-based optimization problem on the execution of web services using intensional results was formalized, and a heuristic search method to find an optimal solution and a greedy algorithm to generate an efficient invocation plan quickly were suggested in this paper. Experimental evaluation shows that the proposed greedy algorithm provides near-optimal solutions in an acceptable time even for a large number of Web services.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1680-1686
• /
• 1996

The deterministic update method of intensional predicates in a parallel deductive database that deductive database is distributed in a parallel computer architecture in needed. Using updated data from the deterministic update method, a strategy for parallel evaluation of intensional predicates is required. The paper is concerned with an approach to updating parallel deductive database in which very insertion or deletion can be performed in a deterministic way, and an extended parallel semi-naive evaluation algorithm in a parallel computer architecture. After presenting an approach to updating intensional predicates and strategy for parallel evaluation, its implementation is discussed. A parallel deductive database consists of the set of facts being the extensional database and the set of rules being the intensional database. We assume that these sets are distributed in each processor, research how to update intensional predicates and evaluate using the update method. The parallel architecture for the deductive database consists of a set of processors and a message passing network to interconnect these processors.

• Language and Information
• /
• v.3 no.2
• /
• pp.67-83
• /
• 1999

This paper attempts to provide an account for the problems of intensional opacity of referring expressions and the presupposition inheritance in the belief contexts from the discourse perspective. I discuss Jaszczolt's discourse model based on DRT to account for the belief reports. Jaszczolt analyzes referring expressions in terms of the three readings(de re, de $dicto_1$ and de $dicto_2$) and attempts to represent the differences between them in the DRS's via different anchoring modes; external anchoring, formal anchoring and nonanchoring. I propose an extended model to account for the presupposition inheritance in the belief contexts and attempt to analyze the data in Korean based on this model. The differences in the PI and in the representations of DRS's which are induced by the different complement types, ${\ldots}ko(mitta)\;and\;{\ldots}kesul(mitta)$, are discussed.