{"title":"合作的逻辑模型","authors":"M. Diaz","doi":"10.1109/FTDCS.1992.217513","DOIUrl":null,"url":null,"abstract":"This paper proposes a formal definition of the concept of cooperation in distributed systems. The proposed model is based on the use of Modal Logic. More precisely, cooperating activities are seen as activities that can be in different cooperating schemas and, as a consequence, follow different Modal logic systems: T, B, S4, S5. It is in particular shown how this model, using a four-valued logic, is able to express contradictions, because predicates can be both True and False in different domains (scopes) of cooperation.<<ETX>>","PeriodicalId":186762,"journal":{"name":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","volume":"297 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"A logical model of cooperation\",\"authors\":\"M. Diaz\",\"doi\":\"10.1109/FTDCS.1992.217513\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a formal definition of the concept of cooperation in distributed systems. The proposed model is based on the use of Modal Logic. More precisely, cooperating activities are seen as activities that can be in different cooperating schemas and, as a consequence, follow different Modal logic systems: T, B, S4, S5. It is in particular shown how this model, using a four-valued logic, is able to express contradictions, because predicates can be both True and False in different domains (scopes) of cooperation.<<ETX>>\",\"PeriodicalId\":186762,\"journal\":{\"name\":\"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems\",\"volume\":\"297 4\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FTDCS.1992.217513\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTDCS.1992.217513","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper proposes a formal definition of the concept of cooperation in distributed systems. The proposed model is based on the use of Modal Logic. More precisely, cooperating activities are seen as activities that can be in different cooperating schemas and, as a consequence, follow different Modal logic systems: T, B, S4, S5. It is in particular shown how this model, using a four-valued logic, is able to express contradictions, because predicates can be both True and False in different domains (scopes) of cooperation.<>