{"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}
引用次数: 0
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.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
