{"title":"OWL-S流程模型匹配","authors":"A. Gater, Daniela Grigori, M. Bouzeghoub","doi":"10.1109/ICWS.2010.85","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an approach for approximate matching of OWL-S process model. We also propose a similarity measure that captures structural and semantic differences between two process models. To do so, we reduce the process matching to a graph matching problem and we adapt existing algorithms for this purpose.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"OWL-S Process Model Matchmaking\",\"authors\":\"A. Gater, Daniela Grigori, M. Bouzeghoub\",\"doi\":\"10.1109/ICWS.2010.85\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose an approach for approximate matching of OWL-S process model. We also propose a similarity measure that captures structural and semantic differences between two process models. To do so, we reduce the process matching to a graph matching problem and we adapt existing algorithms for this purpose.\",\"PeriodicalId\":170573,\"journal\":{\"name\":\"2010 IEEE International Conference on Web Services\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Web Services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICWS.2010.85\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Web Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWS.2010.85","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we propose an approach for approximate matching of OWL-S process model. We also propose a similarity measure that captures structural and semantic differences between two process models. To do so, we reduce the process matching to a graph matching problem and we adapt existing algorithms for this purpose.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
