用配对和解配对函数计算布尔值

2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2012-09-26 DOI:10.1109/SYNASC.2012.20

Paul Tarau, Brenda Luderman

{"title":"用配对和解配对函数计算布尔值","authors":"Paul Tarau, Brenda Luderman","doi":"10.1109/SYNASC.2012.20","DOIUrl":null,"url":null,"abstract":"A pairing function is a bijection f : N × N → N. Its inverse is called an em unpairing function. We show that boolean logic on bit vector variables can be expressed as compositions of pairing/unpairing operations which can emulate boolean evaluation of ordered binary decision trees (OBDTs) of a canonical form. Applications to enumeration and random generation of OBDTs and a generalization to Multi-Terminal Ordered OBDTs (MTOBDT) are also described. The paper is organized as a literate Haskell program (code available at http://logic.csci.unt.edu/tarau/research/2012/hOBDT.hs).","PeriodicalId":173161,"journal":{"name":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"141 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Boolean Evaluation with a Pairing and Unpairing Function\",\"authors\":\"Paul Tarau, Brenda Luderman\",\"doi\":\"10.1109/SYNASC.2012.20\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A pairing function is a bijection f : N × N → N. Its inverse is called an em unpairing function. We show that boolean logic on bit vector variables can be expressed as compositions of pairing/unpairing operations which can emulate boolean evaluation of ordered binary decision trees (OBDTs) of a canonical form. Applications to enumeration and random generation of OBDTs and a generalization to Multi-Terminal Ordered OBDTs (MTOBDT) are also described. The paper is organized as a literate Haskell program (code available at http://logic.csci.unt.edu/tarau/research/2012/hOBDT.hs).\",\"PeriodicalId\":173161,\"journal\":{\"name\":\"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"volume\":\"141 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2012.20\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2012.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

配对函数是一个双射f: N × N→N，它的逆称为em解配对函数。我们证明了位向量变量上的布尔逻辑可以表示为配对/解配对操作的组合，它可以模拟规范形式的有序二叉决策树(obdt)的布尔计算。描述了在枚举和随机生成对象dtd中的应用，以及对多终端有序对象dtd (MTOBDT)的推广。这篇论文被组织成一个读写的Haskell程序(代码可从http://logic.csci.unt.edu/tarau/research/2012/hOBDT.hs获得)。

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

查看原文本刊更多论文

Boolean Evaluation with a Pairing and Unpairing Function

A pairing function is a bijection f : N × N → N. Its inverse is called an em unpairing function. We show that boolean logic on bit vector variables can be expressed as compositions of pairing/unpairing operations which can emulate boolean evaluation of ordered binary decision trees (OBDTs) of a canonical form. Applications to enumeration and random generation of OBDTs and a generalization to Multi-Terminal Ordered OBDTs (MTOBDT) are also described. The paper is organized as a literate Haskell program (code available at http://logic.csci.unt.edu/tarau/research/2012/hOBDT.hs).

求助全文

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

来源期刊

2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

自引率

0.00%

发文量