Cover Image

On Top-Down Pseudo-Boolean Model Counting

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yang, Suwei, Lai, Yong, Meel, Kuldeep S.
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Towards Projected and Incremental Pseudo-Boolean Model Counting
by: Yang, Suwei, et al.
Published: (2024)

On Lower Bounding Minimal Model Count
by: Kabir, Mohimenul, et al.
Published: (2024)

Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks
by: Kabir, Mohimenul, et al.
Published: (2025)

Model Counting in the Wild
by: Shaw, Arijit, et al.
Published: (2024)

Approximate SMT Counting Beyond Discrete Domains
by: Shaw, Arijit, et al.
Published: (2025)

Formally Certified Approximate Model Counting
by: Tan, Yong Kiam, et al.
Published: (2024)

Engineering an Exact Pseudo-Boolean Model Counter
by: Yang, Suwei, et al.
Published: (2023)

Counting Answer Sets of Disjunctive Answer Set Programs
by: Kabir, Mohimenul, et al.
Published: (2025)

Towards Practical First-Order Model Counting
by: Kidambi, Ananth K., et al.
Published: (2025)

A Simple and Effective ASP-Based Tool for Enumerating Minimal Hitting Sets
by: Kabir, Mohimenul, et al.
Published: (2025)

The Limitations and Power of NP-Oracle-Based Functional Synthesis Techniques
by: Juba, Brendan, et al.
Published: (2025)

An ASP-Based Framework for MUSes
by: Kabir, Mohimenul, et al.
Published: (2025)

Efficient Volume Computation for SMT Formulas
by: Shaw, Arijit, et al.
Published: (2025)

An Approximate Skolem Function Counter
by: Shaw, Arijit, et al.
Published: (2023)

Assessing the Quality of Binomial Samplers: A Statistical Distance Framework
by: Sarkar, Uddalok, et al.
Published: (2025)

Counting and Sampling Traces in Regular Languages
by: de Colnet, Alexis, et al.
Published: (2025)

CNFs and DNFs with Exactly $k$ Solutions
by: Chandran, L. Sunil, et al.
Published: (2025)

Model Counting for Dependency Quantified Boolean Formulas
by: Fung, Long-Hin, et al.
Published: (2025)

Towards Practical Zero-Knowledge Proof for PSPACE
by: Karthikeyan, Ashwin, et al.
Published: (2025)

A faster FPRAS for #NFA
by: Meel, Kuldeep S., et al.
Published: (2023)

Efficient Certified Reasoning for Binarized Neural Networks
by: Yang, Jiong, et al.
Published: (2025)

PBLean: Pseudo-Boolean Proof Certificates for Lean 4
by: Szeider, Stefan
Published: (2026)

Rings and Boolean Algebras as Algebraic Theories
by: De Faveri, Arturo
Published: (2025)

Boolean basis, formula size, and number of modal operators
by: Berkholz, Christoph, et al.
Published: (2024)

Pseudo-Boolean d-DNNF Compilation for Expressive Feature Modeling Constructs
by: Sundermann, Chico, et al.
Published: (2025)

Satisfiability of Quantified Boolean Announcements
by: van Ditmarsch, Hans, et al.
Published: (2022)

Deciding Boolean Separation Logic via Small Models (Technical Report)
by: Dacík, Tomáš, et al.
Published: (2024)

Compositional Control-Driven Boolean Circuits
by: Arellanes, Damian
Published: (2025)

Symmetries of Dependency Quantified Boolean Formulas
by: Hofstadler, Clemens, et al.
Published: (2024)

Structural Analysis of Boolean Equation Systems
by: Keiren, Jeroen, et al.
Published: (2010)

Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting
by: Lichter, Moritz
Published: (2022)

Simplifier: A New Tool for Boolean Circuit Simplification
by: Averkov, Daniil, et al.
Published: (2025)

Bringing memory to Boolean networks: a unifying framework
by: Gadouleau, Maximilien, et al.
Published: (2024)

Practical Boolean Decomposition for Delay-driven LUT Mapping
by: Calvino, Alessandro Tempia, et al.
Published: (2024)

Bridging abstract dialectical argumentation and Boolean gene regulation
by: Azpeitia, Eugenio, et al.
Published: (2024)

Minimal Model Counting via Knowledge Compilation
by: Kabir, Mohimenul
Published: (2024)

Complexity of Weighted First-Order Model Counting in the Two-Variable Fragment with Counting Quantifiers: A Bound to Beat
by: Tóth, Jan, et al.
Published: (2024)

On the Number of Quantifiers Needed to Define Boolean Functions
by: Carmosino, Marco, et al.
Published: (2024)

Logics with probabilistic team semantics and the Boolean negation
by: Hannula, Miika, et al.
Published: (2023)

Fixpoint Theory -- Upside Down
by: Baldan, Paolo, et al.
Published: (2021)