{"title":"确定程序的有限逼近算法及其在Prolog中的实现","authors":"Lunjin Lu, P. Greenfield","doi":"10.1007/978-1-4471-3421-3_4","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":194966,"journal":{"name":"UK Conference on Logic Programming","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Algorithm for Finite Approximations of Definite Programs and its Implementation in Prolog\",\"authors\":\"Lunjin Lu, P. Greenfield\",\"doi\":\"10.1007/978-1-4471-3421-3_4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":194966,\"journal\":{\"name\":\"UK Conference on Logic Programming\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"UK Conference on Logic Programming\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-1-4471-3421-3_4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"UK Conference on Logic Programming","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-1-4471-3421-3_4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}