Approach to determination of completeness of composition of Semantic Web-services
A Basic task of the service oriented paradigm/SOA is facilitation the automated composition of services motivated by scenarios developed in electronic commerce and e-science. The problem of the automated composition is begun with the specification of "goal" service and set of acces...
Збережено в:
| Дата: | 2026 |
|---|---|
| Автор: | |
| Формат: | Стаття |
| Мова: | Російська |
| Опубліковано: |
PROBLEMS IN PROGRAMMING
2026
|
| Теми: | |
| Онлайн доступ: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/987 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Problems in programming |
| Завантажити файл: |  |
Репозитарії
Problems in programming| Резюме: | A Basic task of the service oriented paradigm/SOA is facilitation the automated composition of services motivated by scenarios developed in electronic commerce and e-science. The problem of the automated composition is begun with the specification of "goal" service and set of accessible for a search existing services. Composition depends on finding out the proper services on semantic level, mainly, through the entry/exit conditions, and assembling them in a "application" as a purpose service. Basedon this framework, we study in this paper a tightening problemwhich strengthens service discovery queries formulatedfrom conditions in the goal service. A tighter condition canfind more relevant services while a looser one may excludethe possibility of assembling a goal realization. The tighteningproblem is studied for conditions is studied in different logical languages, in this case, ones given for both integers and real numbers constraints.Problems in programming 2009; 3: 30-39 |
|---|