skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


This content will become publicly available on July 13, 2026

Title: Solving Satisfiability Modulo Counting Exactly with Probabilistic Circuits
Award ID(s):
2339844
PAR ID:
10626635
Author(s) / Creator(s):
; ;
Publisher / Repository:
Proceedings of the 41st International Conference on Machine Learning (ICML)
Date Published:
Format(s):
Medium: X
Location:
Vancouver
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email