Weighted Model Counting Without Parameter Variables

[1]  Guy Van den Broeck,et al.  Scaling exact inference for discrete probabilistic programs , 2020, Proc. ACM Program. Lang..

[2]  Adnan Darwiche,et al.  On probabilistic inference by weighted model counting , 2008, Artif. Intell..

[3]  Endre Boros,et al.  Pseudo-Boolean optimization , 2002, Discret. Appl. Math..

[4]  Adnan Darwiche,et al.  Encoding CNFs to Empower Component Analysis , 2006, SAT.

[5]  Luc De Raedt,et al.  Semiring programming: A semantic framework for generalized sum product problems , 2020, Int. J. Approx. Reason..

[6]  Moshe Y. Vardi,et al.  DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees , 2020, CP.

[7]  Adnan Darwiche,et al.  Compiling Probabilistic Graphical Models Using Sentential Decision Diagrams , 2013, ECSQARU.

[8]  Stefan Woltran,et al.  htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond , 2017, CPAIOR.

[9]  Pedro M. Domingos,et al.  Probabilistic theorem proving , 2011, UAI.

[10]  Luc De Raedt,et al.  Inference and learning in probabilistic logic programs using weighted Boolean formulas , 2013, Theory and Practice of Logic Programming.

[11]  Luc De Raedt,et al.  Algebraic model counting , 2012, J. Appl. Log..

[12]  Adnan Darwiche,et al.  On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision , 2001, J. Appl. Non Class. Logics.

[13]  Enrico Macii,et al.  Algebric Decision Diagrams and Their Applications , 1997, ICCAD '93.

[14]  Manfred Jaeger,et al.  Compiling relational Bayesian networks for exact inference , 2006, Int. J. Approx. Reason..

[15]  Scott Sanner,et al.  Practical solution techniques for first-order MDPs , 2009, Artif. Intell..