{"title":"将sd -分辨率应用于一类非horn逻辑程序","authors":"G. Antoniou, E. Langetepe","doi":"10.1093/JIGPAL/2.2.229","DOIUrl":null,"url":null,"abstract":"Methods for dealing with a Horn logic program and one goal are well-known and successful. Here we are concerned with treating logic programs enhanced by some negative literals using the same methods, in particular SLD-resolution. We describe the approach and show its correctness. The result can be applied to default reasoning and has some relevance for model elimination based theorem proving.","PeriodicalId":267129,"journal":{"name":"Bull. IGPL","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Applying SLD-resolution to a class of non-Horn logic programs\",\"authors\":\"G. Antoniou, E. Langetepe\",\"doi\":\"10.1093/JIGPAL/2.2.229\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Methods for dealing with a Horn logic program and one goal are well-known and successful. Here we are concerned with treating logic programs enhanced by some negative literals using the same methods, in particular SLD-resolution. We describe the approach and show its correctness. The result can be applied to default reasoning and has some relevance for model elimination based theorem proving.\",\"PeriodicalId\":267129,\"journal\":{\"name\":\"Bull. IGPL\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bull. IGPL\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1093/JIGPAL/2.2.229\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bull. IGPL","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/JIGPAL/2.2.229","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Applying SLD-resolution to a class of non-Horn logic programs
Methods for dealing with a Horn logic program and one goal are well-known and successful. Here we are concerned with treating logic programs enhanced by some negative literals using the same methods, in particular SLD-resolution. We describe the approach and show its correctness. The result can be applied to default reasoning and has some relevance for model elimination based theorem proving.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
