{"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}
引用次数: 0
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
