{"title":"一种从下到上推导逻辑程序的方案","authors":"Huo-yan Chen","doi":"10.1109/ICSMC.1989.71420","DOIUrl":null,"url":null,"abstract":"In a previous publication (1988), the author proposed an algorithm for the parallel evaluation of logic programs from bottom to top in compile time. In this paper the author improves the algorithm, solving some problems not previously discussed. This leads to a reduction of the required storage space and makes the algorithm more practical.<<ETX>>","PeriodicalId":72691,"journal":{"name":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","volume":"46 1","pages":"875-876 vol.2"},"PeriodicalIF":0.0000,"publicationDate":"1989-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A scheme for deducing logic programs from bottom to top\",\"authors\":\"Huo-yan Chen\",\"doi\":\"10.1109/ICSMC.1989.71420\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a previous publication (1988), the author proposed an algorithm for the parallel evaluation of logic programs from bottom to top in compile time. In this paper the author improves the algorithm, solving some problems not previously discussed. This leads to a reduction of the required storage space and makes the algorithm more practical.<<ETX>>\",\"PeriodicalId\":72691,\"journal\":{\"name\":\"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics\",\"volume\":\"46 1\",\"pages\":\"875-876 vol.2\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSMC.1989.71420\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference proceedings. IEEE International Conference on Systems, Man, and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSMC.1989.71420","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A scheme for deducing logic programs from bottom to top
In a previous publication (1988), the author proposed an algorithm for the parallel evaluation of logic programs from bottom to top in compile time. In this paper the author improves the algorithm, solving some problems not previously discussed. This leads to a reduction of the required storage space and makes the algorithm more practical.<>