Cover Image

Approximate SMT Counting Beyond Discrete Domains

Fuente: arXiv

Saved in:

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

Similar Items

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)

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

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

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)

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

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

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

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

System ASPMT2SMT:Computing ASPMT Theories by SMT Solvers
by: Bartholomew, Michael, et al.
Published: (2025)

SMT(LIA) Sampling with High Diversity
by: Lai, Yong, et al.
Published: (2025)

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

Evaluating SAT and SMT Solvers on Large-Scale Sudoku Puzzles
by: Davis, Liam, 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)

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

Automated Process Planning Based on a Semantic Capability Model and SMT
by: Köcher, Aljosha, et al.
Published: (2023)

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

Layered and Staged Monte Carlo Tree Search for SMT Strategy Synthesis
by: Lu, Zhengyang, et al.
Published: (2024)

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

A Hybrid SMT-NRA Solver: Integrating 2D Cell-Jump-Based Local Search, MCSAT and OpenCAD
by: Ding, Tianyi, et al.
Published: (2025)

Deductive Systems for Logic Programs with Counting
by: Fandinno, Jorge, et al.
Published: (2025)

Approximation Fixpoint Theory with Refined Approximation Spaces
by: Vanbesien, Linde, et al.
Published: (2025)

Solving Satisfiability Modulo Counting Exactly with Probabilistic Circuits
by: Li, Jinzhao, et al.
Published: (2025)

On-the-fly Synthesis for LTL over Finite Traces: An Efficient Approach that Counts
by: Xiao, Shengping, et al.
Published: (2024)

Dsat: A Native SAT Solver for Discrete Logic
by: Zhang, Yaofang, et al.
Published: (2026)

Formally Verified Approximate Policy Iteration
by: Schäffeler, Maximilian, et al.
Published: (2024)

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

Counting Worlds Branching Time Semantics for post-hoc Bias Mitigation in generative AI
by: Buda, Alessandro G., et al.
Published: (2026)

The Universal PDDL Domain
by: Haslum, Patrik, et al.
Published: (2024)

Approximate matrices of systems of max-min fuzzy relational equations
by: Baaj, Ismaïl
Published: (2025)

Compilation and Fast Model Counting beyond CNF
by: de Colnet, Alexis, et al.
Published: (2025)

Faster Lifting for Ordered Domains with Predecessor Relations
by: Zou, Kuncheng, et al.
Published: (2025)

Integrating Belief Domains into Probabilistic Logic Programs
by: Azzolini, Damiano, et al.
Published: (2025)

Epistemic Logic Programs: Non-Ground and Counting Complexity
by: Eiter, Thomas, et al.
Published: (2025)

Robustness of Constraint Automata for Description Logics with Concrete Domains
by: Demri, Stéphane, et al.
Published: (2026)

Modal Logic for Stratified Becoming: Actualization Beyond Possible Worlds
by: Nepvou, Alexandre Le
Published: (2025)

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

Decidable Reasoning About Time in Finite-Domain Situation Calculus Theories
by: Hofmann, Till, et al.
Published: (2024)