Weighed Model Counting in FO2 with Cardinality Constraints and Counting Quantifiers: A Closed Form Formula

Weighted First Order Model Counting (WFOMC) computes the weighted sum of the models of a first order theory on a domain of a given finite size. WFOMC has emerged as a fundamental tool for probabilistic inference. Algorithms for WFOMC that run in polynomial time w.r.t. the domain size are called lifted inference algorithms. Such algorithms have been developed for multiple extensions of FO$^2$(the fragment of First Order Logic with two variables) for the special case of symmetric weight functions. In this paper, instead of developing a specific algorithm, we derive a closed form formula for WFOMC in FO$^2$. The three key advantages of our proposal are: (i) it deals with existential quantifiers without introducing negative weights; (ii) it easily extends to FO$^2$ with cardinality constraints and counting quantifiers (aka C$^2$); finally, (iii) it supports WFOMC for a class of weight functions strictly larger than symmetric weight functions, which can model count distributions, without introducing complex or negative weights.

[1]  Pierre Marquis,et al.  A Knowledge Compilation Map , 2002, J. Artif. Intell. Res..

[2]  Antti Kuusisto,et al.  Uniform One-Dimensional Fragments with One Equivalence Relation , 2015, CSL.

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

[4]  Dan Roth,et al.  Lifted First-Order Probabilistic Inference , 2005, IJCAI.

[5]  Luc De Raedt,et al.  Statistical Relational Artificial Intelligence: Logic, Probability, and Computation , 2016, Statistical Relational Artificial Intelligence.

[6]  Guy Van den Broeck,et al.  New Liftable Classes for First-Order Probabilistic Inference , 2016, NIPS.

[7]  Luc De Raedt,et al.  Lifted Probabilistic Inference by First-Order Knowledge Compilation , 2011, IJCAI.

[8]  Guy Van den Broeck,et al.  Domain Recursion for Lifted Inference with Existential Quantifiers , 2017, ArXiv.

[9]  Carsten Lutz,et al.  Weighted model counting beyond two-variable logic , 2018, LICS.

[10]  Ondrej Kuzelka,et al.  Complex Markov Logic Networks: Expressivity and Liftability , 2020, UAI.

[11]  Erich Grädel,et al.  Two-variable logic with counting is decidable , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[12]  Guy Van den Broeck.  On the Completeness of First-Order Knowledge Compilation for Lifted Probabilistic Inference , 2011, NIPS.

[13]  Guy Van den Broeck,et al.  Skolemization for Weighted First-Order Model Counting , 2013, KR.

[14]  David Poole,et al.  First-order probabilistic inference , 2003, IJCAI.