使用扩展WAM的析取逻辑程序的编译

Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96 Pub Date : 1996-08-19 DOI:10.1109/CMPSAC.1996.544149

Dongha Shin, M. Hilton

{"title":"使用扩展WAM的析取逻辑程序的编译","authors":"Dongha Shin, M. Hilton","doi":"10.1109/CMPSAC.1996.544149","DOIUrl":null,"url":null,"abstract":"We show that disjunctive logic programs can be efficiently compiled to an extended version of Warren's Abstract Machine (WAM). In this compilation, we use D.A. Plaisted's (1988) Modified Problem Reaction Format (MPRF) as the basic proof procedure. Compilation of disjunctive logic programs is done in two stages: 1) the axioms and proof rules of MPRF are used to convert the disjunctive logic program into an equivalent Prolog program; and 2) this Prolog program is compiled to a WAM that has been modified to support efficient implementation of the axioms and splitting rule of MPRF. The modified WAM's design and some measurements of its performance are presented.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Compilation of disjunctive logic programs using an extended WAM\",\"authors\":\"Dongha Shin, M. Hilton\",\"doi\":\"10.1109/CMPSAC.1996.544149\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that disjunctive logic programs can be efficiently compiled to an extended version of Warren's Abstract Machine (WAM). In this compilation, we use D.A. Plaisted's (1988) Modified Problem Reaction Format (MPRF) as the basic proof procedure. Compilation of disjunctive logic programs is done in two stages: 1) the axioms and proof rules of MPRF are used to convert the disjunctive logic program into an equivalent Prolog program; and 2) this Prolog program is compiled to a WAM that has been modified to support efficient implementation of the axioms and splitting rule of MPRF. The modified WAM's design and some measurements of its performance are presented.\",\"PeriodicalId\":306601,\"journal\":{\"name\":\"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-08-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPSAC.1996.544149\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.1996.544149","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们证明了析取逻辑程序可以有效地编译成Warren抽象机(WAM)的扩展版本。在本汇编中，我们使用d.a Plaisted(1988)的修正问题反应格式(MPRF)作为基本证明程序。析取逻辑程序的编制分两个阶段完成:1)利用MPRF的公理和证明规则将析取逻辑程序转化为等价的Prolog程序;2)将该Prolog程序编译为经过修改的WAM，以支持MPRF的公理和分割规则的有效实现。介绍了改进后的WAM的设计和一些性能测试。

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

查看原文本刊更多论文

Compilation of disjunctive logic programs using an extended WAM

We show that disjunctive logic programs can be efficiently compiled to an extended version of Warren's Abstract Machine (WAM). In this compilation, we use D.A. Plaisted's (1988) Modified Problem Reaction Format (MPRF) as the basic proof procedure. Compilation of disjunctive logic programs is done in two stages: 1) the axioms and proof rules of MPRF are used to convert the disjunctive logic program into an equivalent Prolog program; and 2) this Prolog program is compiled to a WAM that has been modified to support efficient implementation of the axioms and splitting rule of MPRF. The modified WAM's design and some measurements of its performance are presented.

求助全文

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

来源期刊

Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96

自引率

0.00%

发文量