将sd -分辨率应用于一类非horn逻辑程序

Bull. IGPL Pub Date : 1994-09-01 DOI:10.1093/JIGPAL/2.2.229

G. Antoniou, E. Langetepe

{"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}

引用次数: 5

摘要

处理霍恩逻辑程序和一个目标的方法是众所周知的和成功的。在这里，我们关注的是如何使用相同的方法处理由一些负面文字增强的逻辑程序，特别是sld分辨率。我们描述了这种方法，并证明了它的正确性。该结果可应用于默认推理，并与基于模型消去的定理证明有一定的相关性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Bull. IGPL

自引率

0.00%

发文量