{"title":"一种使用“硬连线”启发式进行画面推理的方法","authors":"H. Berghel, R. Rankin, Farrukh Burney","doi":"10.1145/99412.99436","DOIUrl":null,"url":null,"abstract":"In this paper we discuss a prototype of the tableau method which derives its rule base from Jeffrey's text [3]. The heuristics are a subset of those outlined for HARP by Oppacher and Suen [4]. The prototype was written in C and intended for use with the IBM family of microcomputers. We shall outline some of our implementation strategies and, insofar as is possible, contrast them with those of the earlier pioneering work of Oppacher and Suen.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An approach to tableau inferencing with “hardwired” heuristics\",\"authors\":\"H. Berghel, R. Rankin, Farrukh Burney\",\"doi\":\"10.1145/99412.99436\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we discuss a prototype of the tableau method which derives its rule base from Jeffrey's text [3]. The heuristics are a subset of those outlined for HARP by Oppacher and Suen [4]. The prototype was written in C and intended for use with the IBM family of microcomputers. We shall outline some of our implementation strategies and, insofar as is possible, contrast them with those of the earlier pioneering work of Oppacher and Suen.\",\"PeriodicalId\":147067,\"journal\":{\"name\":\"Symposium on Small Systems\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Symposium on Small Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/99412.99436\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symposium on Small Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/99412.99436","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An approach to tableau inferencing with “hardwired” heuristics
In this paper we discuss a prototype of the tableau method which derives its rule base from Jeffrey's text [3]. The heuristics are a subset of those outlined for HARP by Oppacher and Suen [4]. The prototype was written in C and intended for use with the IBM family of microcomputers. We shall outline some of our implementation strategies and, insofar as is possible, contrast them with those of the earlier pioneering work of Oppacher and Suen.