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.

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 11:00 PM ET on Friday, November 14 until 2:00 AM ET on Saturday, November 15 due to maintenance. We apologize for the inconvenience.

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


Title: Solving Satisfiability Modulo Counting for Symbolic and Statistical AI Integration with Provable Guarantees
Award ID(s):
2339844 1918327
PAR ID:
10562771
Author(s) / Creator(s):
; ;
Publisher / Repository:
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence (AAAI)
Date Published:
Volume:
38
Issue:
18
Page Range / eLocation ID:
20481-20490
Format(s):
Medium: X
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