Approximate SMT Counting Beyond Discrete Domains

Satisfiability Modulo Theory (SMT) solvers have advanced automated reasoning, solving complex formulas across discrete and continuous domains. Recent progress in propositional model counting motivates extending SMT capabilities toward model counting, especially for hybrid SMT formulas. Existing appr...

Full description

Bibliographic Details

Published in:	2025 62nd ACM/IEEE Design Automation Conference (DAC) pp. 1 - 7
Main Authors:	Shaw, Arijit, Meel, Kuldeep S.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 22.06.2025
Subjects:	Benchmark testing Cognition Design automation Hash functions
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!