Arjun: An Efficient Independent Support Computation Technique and its Applications to Counting and Sampling

Given a Boolean formula φ over the set of variables X and a projection set \mathcal{P} \subseteq X, then if \mathcal{I} \subseteq \mathcal{P} is independent support of \mathcal{P}, then if two solutions of φ agree on I, then they also agree on \mathcal{P}. The notion of independent support is relate...

Full description

Saved in:
Bibliographic Details
Published in:2022 IEEE/ACM International Conference On Computer Aided Design (ICCAD) pp. 1 - 9
Main Authors: Soos, Mate, Meel, Kuldeep S.
Format: Conference Proceeding
Language:English
Published: ACM 29.10.2022
Subjects:
Benchmark testing
Computational efficiency
Computational modeling
Design automation
Logic gates
ISSN:1558-2434
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Given a Boolean formula φ over the set of variables X and a projection set \mathcal{P} \subseteq X, then if \mathcal{I} \subseteq \mathcal{P} is independent support of \mathcal{P}, then if two solutions of φ agree on I, then they also agree on \mathcal{P}. The notion of independent support is related to the classical notion of definability dating back to 1901, and have been studied over the decades. Recently, the computational problem of determining independent support for a given formula has attained importance owing to the crucial importance of independent support for hashing-based counting and sampling techniques.In this paper, we design an efficient and scalable independent support computation technique that can handle formulas arising from real-world benchmarks. Our algorithmic framework, called Arjun 1 , employs implicit and explicit definability notions, and is based on a tight integration of gate-identification techniques and assumption-based framework. We demonstrate that augmenting the state-of-the-art model counter ApproxMC4 and sampler UniGen3 with Arjun leads to significant performance improvements. In particular, ApproxMC4 augmented with Arjun counts 576 more bench-marks out of 1896 while UniGen3 augmented with Arjun samples 335 more benchmarks within the same time limit.
AbstractList Given a Boolean formula φ over the set of variables X and a projection set \mathcal{P} \subseteq X, then if \mathcal{I} \subseteq \mathcal{P} is independent support of \mathcal{P}, then if two solutions of φ agree on I, then they also agree on \mathcal{P}. The notion of independent support is related to the classical notion of definability dating back to 1901, and have been studied over the decades. Recently, the computational problem of determining independent support for a given formula has attained importance owing to the crucial importance of independent support for hashing-based counting and sampling techniques.In this paper, we design an efficient and scalable independent support computation technique that can handle formulas arising from real-world benchmarks. Our algorithmic framework, called Arjun 1 , employs implicit and explicit definability notions, and is based on a tight integration of gate-identification techniques and assumption-based framework. We demonstrate that augmenting the state-of-the-art model counter ApproxMC4 and sampler UniGen3 with Arjun leads to significant performance improvements. In particular, ApproxMC4 augmented with Arjun counts 576 more bench-marks out of 1896 while UniGen3 augmented with Arjun samples 335 more benchmarks within the same time limit.
Author Soos, Mate
Meel, Kuldeep S.
Author_xml – sequence: 1
  givenname: Mate
  surname: Soos
  fullname: Soos, Mate
  organization: National University of Singapore,Singapore
– sequence: 2
  givenname: Kuldeep S.
  surname: Meel
  fullname: Meel, Kuldeep S.
  organization: National University of Singapore,Singapore
BookMark eNotjj1PwzAQhg0CiVI6szD4D6Scv2KbLapaqFSJoWWu7MQpLq1jEmfg32MVhnvvlZ5Hp7tHN6ELDqFHAnNCuHhmAhQTdM4E1xzKKzTTUmUATFMi-TWaECFUQTnjd2g2DEcAoEoSKWGCvqr-OIYXXAW8bFtfexcSXofGRZcj9-0YY9cnvOjOcUwm-S7gnas_g_8eHTahwT4NuIrx5OsLHXDqsj2G5MPhImzNOdNweEC3rTkNbva_p-hjtdwt3orN--t6UW0KQ7lKhW2oslpzwWltQBLrDC_zKGPz07okEoxVRhlJpQFuwQqmOSkpiNbKkrIpevq7651z-9j7s-l_9gSgVFpo9gv331qN
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1145/3508352.3549406
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library (IEL) (UW System Shared)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library (IEL) (UW System Shared)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 9781450392174
1450392172
EISSN 1558-2434
EndPage 9
ExternalDocumentID 10068959
Genre orig-research
GrantInformation_xml – fundername: Ministry of Education
  funderid: 10.13039/100009950
– fundername: National Research Foundation Singapore
  funderid: 10.13039/501100001381
GroupedDBID 6IE
6IF
6IH
6IL
6IN
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
FEDTE
IEGSK
IJVOP
M43
OCL
RIE
RIL
RIO
ID FETCH-LOGICAL-a248t-bd28b994542ca071bea46ea48ab71796170ab8a8a727a04b0b539416205fb7623
IEDL.DBID RIE
ISICitedReferencesCount 13
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000981574300070&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:46:16 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a248t-bd28b994542ca071bea46ea48ab71796170ab8a8a727a04b0b539416205fb7623
PageCount 9
ParticipantIDs ieee_primary_10068959
PublicationCentury 2000
PublicationDate 2022-Oct.-29
PublicationDateYYYYMMDD 2022-10-29
PublicationDate_xml – month: 10
  year: 2022
  text: 2022-Oct.-29
  day: 29
PublicationDecade 2020
PublicationTitle 2022 IEEE/ACM International Conference On Computer Aided Design (ICCAD)
PublicationTitleAbbrev ICCAD
PublicationYear 2022
Publisher ACM
Publisher_xml – name: ACM
SSID ssj0002871770
ssj0020286
Score 2.3542035
Snippet Given a Boolean formula φ over the set of variables X and a projection set \mathcal{P} \subseteq X, then if \mathcal{I} \subseteq \mathcal{P} is independent...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Benchmark testing
Computational efficiency
Computational modeling
Design automation
Logic gates
Title Arjun: An Efficient Independent Support Computation Technique and its Applications to Counting and Sampling
URI https://ieeexplore.ieee.org/document/10068959
WOSCitedRecordID wos000981574300070&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NS8MwGA5ueNCLXxO_ycFrZpemTeJtjA0FGQMn7DbetIlMIZOt8_f7JuvmLh48FNpQQnjT5n3y8TwPIfdgeJHr0rHAY2Si40oWnI6YNQ4ElNJCJxKFX-RwqCYTParJ6pELY62Nh89sO9zGvfxyXqzCUhn-4UmudKYbpCGlXJO1tgsqAfrL8PHVsy0syGstn47IHtIsgo12ihMiEfyNdsxUYi4ZHP2zFcek9cvKo6Ntvjkhe9afksMdQcEz8tldfKz8I-162o_aEFgTfd463VY0mHgi4KZrM4fYK3S8kXGl4Es6q5a0u7OrTas57dWGEvGFVwiH0P17i7wN-uPeE6vtFBhwoSpmSq6M1iITvABEFsaCyPFSYDByOiizg1GgACENJMIkJks14jWeZM7gmJmek6afe3tBqBZSGC6cQ_gkSsiBa4uDvuZ5YRw-X5JWiNv0a62YMd2E7OqP8mtywAOtAHMC1zekWS1W9pbsF9_VbLm4i_38A-U0qc0
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwGP3QKagv3ibezYOvmW369RLfhmxsOMfACXsbX9pUptDJ1vn7TbJu7sUHHwJNKKV8uZ1czjkA96REGsks55bHyNHPM26djrhWOSFlsSbfEYV7cb-fjEZyUJHVHRdGa-0un-mGfXRn-dk0XditMtPDvSiRodyGnRBR-Eu61npLxYL_2Da_ar1lCqJKzcfH8CEIHdxoBGZJhNbhaMNOxc0m7cN__scR1H95eWywnnGOYUsXJ3CwISl4Cp_N2ceieGTNgrWcOoT5EuuuvW5LZm08DeRmSzsHVy9suBJyZVRkbFLOWXPjXJuVU_ZUWUq4F17JXkMv3uvw1m4Nnzq8MlTgJDApucpEoqTEEEVKBlsoTRiZlJAykZNWm51UQgkZUEMeKk-FgTSITXhhrsyoGZxBrZgW-hyYxBiVwDw3AAozikhIbYZ9KaJU5SZ_AXUbt_HXUjNjvArZ5R_ld7DXGb70xr1u__kK9oUlGXg-F-IaauVsoW9gN_0uJ_PZravzH-fzrQ0
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2022+IEEE%2FACM+International+Conference+On+Computer+Aided+Design+%28ICCAD%29&rft.atitle=Arjun%3A+An+Efficient+Independent+Support+Computation+Technique+and+its+Applications+to+Counting+and+Sampling&rft.au=Soos%2C+Mate&rft.au=Meel%2C+Kuldeep+S.&rft.date=2022-10-29&rft.pub=ACM&rft.eissn=1558-2434&rft.spage=1&rft.epage=9&rft_id=info:doi/10.1145%2F3508352.3549406&rft.externalDocID=10068959