Weighted model integration (WMI) is a very appealing framework for probabilistic inference: it allows to express the complex dependencies of real-world hybrid scenarios where variables are heterogeneous in nature (both continuous and discrete) via the language of Satisfiability Modulo Theories (SMT); as well as computing probabilistic queries with arbitrarily complex logical constraints. Recent work has shown WMI inference to be reducible to a model integration (MI) problem, under some assumptions, thus effectively allowing hybrid probabilistic reasoning by volume computations. In this paper, we introduce a novel formulation of MI via a message passing scheme that allows to efficiently compute the marginal densities and statistical moments of all the variables in linear time. As such, we are able to amortize inference for arbitrarily rich MI queries when they conform to the problem structure, here represented as the primal graph associated to the SMT formula. Furthermore, we theoretically trace the tractability boundaries of exact MI. Indeed, we prove that in terms of the structural requirements on the primal graph that make our MI algorithm tractable - bounding its diameter and treewidth - the bounds are not only sufficient, but necessary for tractable inference via MI.

@inproceedings{ZengKR2ML19,
  author    = {Zeng, Zhe and Yan, Fanqi and Morettin, Paolo and Vergari, Antonio and Van den Broeck, Guy},
  title     = {Hybrid Probabilistic Inference with Logical Constraints: Tractability and Message Passing},
  booktitle = {Proceedings of the NeurIPS Workshop on Knowledge Representation and Reasoning Meets Machine Learning (KR2ML)},
  month     = 12,
  year      = {2019},
  url       = {http://starai.cs.ucla.edu/papers/ZengKR2ML19.pdf},
  keywords  = {workshop}
}