Model Counting Meets Distinct Elements

IF 11.1 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
A. Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel
{"title":"Model Counting Meets Distinct Elements","authors":"A. Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel","doi":"10.1145/3607824","DOIUrl":null,"url":null,"abstract":"Constraint satisfaction problems (CSPs) and data stream models are two powerful abstractions to capture a wide variety of problems arising in different domains of computer science. Developments in the two communities have mostly occurred independently and with little interaction between them. In this work, we seek to investigate whether bridging the seeming communication gap between the two communities may pave the way to richer fundamental insights. To this end, we focus on two foundational problems: model counting for CSPs and the computation of the number of distinct elements in a data stream, also known as the zeroth frequency moment (F0) of a data stream. Our investigations lead us to observe striking similarity in the core techniques employed in the algorithmic frameworks that have evolved separately for model counting and distinct elements computation. We design a recipe for the translation of algorithms developed for distinct elements estimation to that of model counting, resulting in new algorithms for model counting. We then observe that algorithms in the context of distributed streaming can be transformed into distributed algorithms for model counting. We next turn our attention to viewing streaming from the lens of counting and show that framing distinct elements estimation as a special case of #DNF counting allows us to obtain a general recipe for a rich class of streaming problems, which had been subjected to case-specific analysis in prior works.","PeriodicalId":10594,"journal":{"name":"Communications of the ACM","volume":"66 1","pages":"95 - 102"},"PeriodicalIF":11.1000,"publicationDate":"2023-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Communications of the ACM","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1145/3607824","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Constraint satisfaction problems (CSPs) and data stream models are two powerful abstractions to capture a wide variety of problems arising in different domains of computer science. Developments in the two communities have mostly occurred independently and with little interaction between them. In this work, we seek to investigate whether bridging the seeming communication gap between the two communities may pave the way to richer fundamental insights. To this end, we focus on two foundational problems: model counting for CSPs and the computation of the number of distinct elements in a data stream, also known as the zeroth frequency moment (F0) of a data stream. Our investigations lead us to observe striking similarity in the core techniques employed in the algorithmic frameworks that have evolved separately for model counting and distinct elements computation. We design a recipe for the translation of algorithms developed for distinct elements estimation to that of model counting, resulting in new algorithms for model counting. We then observe that algorithms in the context of distributed streaming can be transformed into distributed algorithms for model counting. We next turn our attention to viewing streaming from the lens of counting and show that framing distinct elements estimation as a special case of #DNF counting allows us to obtain a general recipe for a rich class of streaming problems, which had been subjected to case-specific analysis in prior works.
模型计数遇到不同元素
约束满足问题(csp)和数据流模型是捕获计算机科学不同领域中出现的各种问题的两个强大的抽象。两个社区的发展大多是独立发生的,它们之间很少相互作用。在这项工作中,我们试图调查弥合两个社区之间表面上的沟通差距是否可以为更丰富的基本见解铺平道路。为此,我们专注于两个基本问题:csp的模型计数和数据流中不同元素数量的计算,也称为数据流的第零频率矩(F0)。我们的研究使我们观察到算法框架中采用的核心技术的惊人相似性,这些算法框架分别为模型计数和不同元素计算而发展。我们设计了一种将用于不同元素估计的算法转换为模型计数的算法的配方,从而产生新的模型计数算法。然后我们观察到分布式流上下文中的算法可以转换为用于模型计数的分布式算法。接下来,我们将注意力转向从计数的角度来看流,并表明将不同元素估计框架作为#DNF计数的特殊情况,使我们能够获得一类丰富的流问题的通用配方,这些问题在以前的工作中已经受到具体情况的分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Communications of the ACM
Communications of the ACM 工程技术-计算机:理论方法
CiteScore
16.10
自引率
0.40%
发文量
276
审稿时长
6-12 weeks
期刊介绍: Communications of the ACM is the leading print and online publication for the computing and information technology fields. Read by computing''s leading professionals worldwide, Communications is recognized as the most trusted and knowledgeable source of industry information for today’s computing professional. Following the traditions of the Communications print magazine, which each month brings its readership of over 100,000 ACM members in-depth coverage of emerging areas of computer science, new trends in information technology, and practical applications, the Communications website brings topical and informative news and material to computing professionals each business day. ACM''s membership includes the IT industry''s most respected leaders and decision makers. Industry leaders have for more than 50 years used the monthly Communications of the ACM magazine as a platform to present and debate various technology implications, public policies, engineering challenges, and market trends. The Communications website continues that practice.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信