{"title":"GOPT决议","authors":"Fei Liu, J. Roddick","doi":"10.1504/IJAISC.2011.042714","DOIUrl":null,"url":null,"abstract":"Some resolution strategies, such as SLD-resolution, are such that a derivation may be infinite even on a logic program that has a finite Herbrand universe. This paper introduces GOPT-resolution, a new deduction strategy for deriving solutions from a set of rules that improves on previous methods by preventing derivations that have infinite recursion. The paper outlines the process behind the development of GOPT-resolution based on PT-resolution. GOPT-resolution is then developed by distinguishing between goal-relevant and goal-irrelevant P-domains.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"105 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"GOPT Resolution\",\"authors\":\"Fei Liu, J. Roddick\",\"doi\":\"10.1504/IJAISC.2011.042714\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Some resolution strategies, such as SLD-resolution, are such that a derivation may be infinite even on a logic program that has a finite Herbrand universe. This paper introduces GOPT-resolution, a new deduction strategy for deriving solutions from a set of rules that improves on previous methods by preventing derivations that have infinite recursion. The paper outlines the process behind the development of GOPT-resolution based on PT-resolution. GOPT-resolution is then developed by distinguishing between goal-relevant and goal-irrelevant P-domains.\",\"PeriodicalId\":364571,\"journal\":{\"name\":\"Int. J. Artif. Intell. Soft Comput.\",\"volume\":\"105 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Artif. Intell. Soft Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJAISC.2011.042714\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Artif. Intell. Soft Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJAISC.2011.042714","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Some resolution strategies, such as SLD-resolution, are such that a derivation may be infinite even on a logic program that has a finite Herbrand universe. This paper introduces GOPT-resolution, a new deduction strategy for deriving solutions from a set of rules that improves on previous methods by preventing derivations that have infinite recursion. The paper outlines the process behind the development of GOPT-resolution based on PT-resolution. GOPT-resolution is then developed by distinguishing between goal-relevant and goal-irrelevant P-domains.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
