Approximate weighted model integration on DNF structures
Weighted model counting consists of computing the weighted sum of all satisfying assignments of a propositional formula. Weighted model counting is well-known to be #P-hard for exact solving, but admits a fully polynomial randomized approximation scheme when restricted to DNF structures. In this wor...
Principais autores: | Abboud, R, Ceylan, İİ, Dimitrov, R |
---|---|
Formato: | Journal article |
Idioma: | English |
Publicado em: |
Elsevier
2022
|
Registros relacionados
-
Learning to reason: Leveraging neural networks for approximate DNF counting
por: Abboud, R, et al.
Publicado em: (2020) -
BoxE: A box embedding model for knowledge base completion
por: Abboud, R, et al.
Publicado em: (2020) -
Weighted Optimal Formulas for Approximate Integration
por: Kholmat Shadimetov, et al.
Publicado em: (2024-02-01) -
The surprising power of graph neural networks with random node initialization
por: Abboud, R, et al.
Publicado em: (2021) -
A STRUCTURED APPROXIMATION PROBLEM WITH APPLICATIONS TO FREQUENCY WEIGHTED MODEL-REDUCTION
por: Glover, K, et al.
Publicado em: (1992)