During the execution of functional logic programs particular E uni cation pro blems have to be solved quite frequently In this paper we contribute to the e cient solution of such problems in the case where E is induced by particular term rewriting systems called macro tree transducers We formalize the implementation of a deter ministic partial E uni cation algorithm on a deterministic abstract machine called twin uni cation machine The uni cation algorithm is based on a particular narrow ing strategy which combines leftmost outermost narrowing with a local constructor consistency check and a particular occur check The twin uni cation machine uses two runtime stacks it is an extension of an e cient leftmost outermost reduction machine for macro tree transducers The feasibility of the presented implementation technique is proved by an implementation which has been developed on a SPARCstation SLC The work of the authors are supported by the Deutsche Forschungsgemeinschaft DFG
{"title":"Implementation of a Deterministic Partial E-Unification Algorithm for Macro Tree Transducers","authors":"H. Faßbender, Andrea Mößle, H. Vogler","doi":"10.18725/OPARU-1679","DOIUrl":"https://doi.org/10.18725/OPARU-1679","url":null,"abstract":"During the execution of functional logic programs particular E uni cation pro blems have to be solved quite frequently In this paper we contribute to the e cient solution of such problems in the case where E is induced by particular term rewriting systems called macro tree transducers We formalize the implementation of a deter ministic partial E uni cation algorithm on a deterministic abstract machine called twin uni cation machine The uni cation algorithm is based on a particular narrow ing strategy which combines leftmost outermost narrowing with a local constructor consistency check and a particular occur check The twin uni cation machine uses two runtime stacks it is an extension of an e cient leftmost outermost reduction machine for macro tree transducers The feasibility of the presented implementation technique is proved by an implementation which has been developed on a SPARCstation SLC The work of the authors are supported by the Deutsche Forschungsgemeinschaft DFG","PeriodicalId":149752,"journal":{"name":"J. Funct. Log. Program.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114534489","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-01-17DOI: 10.1007/3-540-46584-7_12
Zhenjiang Hu, W. Chin, M. Takeichi
{"title":"Calculating a New Data Mining Algorithm for Market Basket Analysis","authors":"Zhenjiang Hu, W. Chin, M. Takeichi","doi":"10.1007/3-540-46584-7_12","DOIUrl":"https://doi.org/10.1007/3-540-46584-7_12","url":null,"abstract":"","PeriodicalId":149752,"journal":{"name":"J. Funct. Log. Program.","volume":"2011 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131879606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1996-09-25DOI: 10.1007/3-540-61735-3_17
R. Kennaway, V. V. Oostrom, F. D. Vries
{"title":"Meaningless Terms in Rewriting","authors":"R. Kennaway, V. V. Oostrom, F. D. Vries","doi":"10.1007/3-540-61735-3_17","DOIUrl":"https://doi.org/10.1007/3-540-61735-3_17","url":null,"abstract":"","PeriodicalId":149752,"journal":{"name":"J. Funct. Log. Program.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115916661","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1996-09-25DOI: 10.1007/3-540-61735-3_13
H. Faßbender, S. Maneth
{"title":"A Strict Border for the Decidability of E-Unification for Recursive Functions","authors":"H. Faßbender, S. Maneth","doi":"10.1007/3-540-61735-3_13","DOIUrl":"https://doi.org/10.1007/3-540-61735-3_13","url":null,"abstract":"","PeriodicalId":149752,"journal":{"name":"J. Funct. Log. Program.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125100516","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：