ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2008.08748
  4. Cited By
DPMC: Weighted Model Counting by Dynamic Programming on Project-Join
  Trees

DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees

20 August 2020
Jeffrey M. Dudek
Vu Hoang Nguyen Phan
Moshe Y. Vardi
ArXiv (abs)PDFHTML

Papers citing "DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees"

3 / 3 papers shown
Title
Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder
  than SAT after All?
Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder than SAT after All?
Markus Hecher
62
25
0
07 Oct 2022
DPER: Dynamic Programming for Exist-Random Stochastic SAT
DPER: Dynamic Programming for Exist-Random Stochastic SAT
Vu Hoang Nguyen Phan
Moshe Y. Vardi
28
1
0
19 May 2022
DPMS: An ADD-Based Symbolic Approach for Generalized MaxSAT Solving
DPMS: An ADD-Based Symbolic Approach for Generalized MaxSAT Solving
Anastasios Kyrillidis
Moshe Y. Vardi
Zhiwei Zhang
23
3
0
08 May 2022
1