Cover Image

An Approximate Skolem Function Counter

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shaw, Arijit, Juba, Brendan, Meel, Kuldeep S.
Format:	Preprint
Published:	2023
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

Skolemization In Intermediate Logics
by: Baaz, Matthias, et al.
Published: (2025)

On Top-Down Pseudo-Boolean Model Counting
by: Yang, Suwei, et al.
Published: (2025)

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

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

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

The nonexistence of unicorns and many-sorted Löwenheim-Skolem theorems
by: Przybocki, Benjamin, et al.
Published: (2024)

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

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

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

Skolem and Positivity Completeness of Ergodic Markov Chains
by: Vahanwala, Mihir
Published: (2023)

On Robustness for the Skolem, Positivity and Ultimate Positivity Problems
by: Akshay, S., et al.
Published: (2022)

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

On the Complexity of the Skolem Problem at Low Orders
by: Bacik, Piotr, et al.
Published: (2025)

Skolemization and Decidability of the Bernays-Schoenfinkel Class in Goedel Logics
by: Gamsakhurdia, Mariami, et al.
Published: (2025)

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

The Skolem Problem in rings of positive characteristic
by: Dong, Ruiwen, et al.
Published: (2025)

On the Subspace Orbit Problem and the Simultaneous Skolem Problem
by: Bacik, Piotr, et al.
Published: (2026)

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

Blurred Drinker Paradoxes and Blurred Choice Axioms: Constructive Reverse Mathematics of the Downward Löwenheim-Skolem Theorem
by: Kirst, Dominik, et al.
Published: (2026)

Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization
by: Chatterjee, Krishnendu, et al.
Published: (2024)

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

On the Counting Complexity of the Skolem Problem
by: Jindal, Gorav, et al.
Published: (2024)

Filling in the semantics for intuitionistic conditional logic
by: Dufty, Brendan, et al.
Published: (2025)

On the $p$-adic Skolem Problem
by: Bacik, Piotr, et al.
Published: (2025)

Approximating Fixpoints of Approximated Functions
by: Baldan, Paolo, et al.
Published: (2025)

Loop-Checking and Counter-Model Extraction for Intuitionistic Tense Logics via Nested Sequents
by: Lyon, Tim S.
Published: (2026)

Towards Verifying Exact Conditions for Implementations of Density Functional Approximations
by: Helal, Sameerah, et al.
Published: (2024)

Proof-Theoretic Functional Completeness for the Connexive Logic C
by: Ayhan, Sara, et al.
Published: (2025)

Quantitative and Approximate Monitoring
by: Henzinger, Thomas A., et al.
Published: (2021)

Definable sets in Skolem arithmetic
by: Kamiński, Łukasz
Published: (2025)

Approximation theory for distant Bang calculus
by: Chardonnet, Kostia, et al.
Published: (2026)

A Spectrum of Approximate Probabilistic Bisimulations
by: Spork, Timm, et al.
Published: (2024)