Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Complexity of Weighted First-Order Model Counting in the Two-Variable Fragment with Counting Quantifiers: A Bound to Beat (2404.12905v2)

Published 19 Apr 2024 in cs.LO

Abstract: We study the time complexity of the weighted first-order model counting (WFOMC) over the logical language with two variables and counting quantifiers. The problem is known to be solvable in time polynomial in the domain size. However, the degree of the polynomial, which turns out to be relatively high for most practical applications, has never been properly addressed. First, we formulate a time complexity bound for the existing techniques for solving WFOMC with counting quantifiers. The bound is already known to be a polynomial with its degree depending on the number of cells of the input formula. We observe that the number of cells depends, in turn, exponentially on the parameter of the counting quantifiers appearing in the formula. Second, we propose a new approach to dealing with counting quantifiers, reducing the exponential dependency to a quadratic one, therefore obtaining a tighter upper bound. It remains an open question whether the dependency of the polynomial degree on the counting quantifiers can be reduced further, thus making our new bound a bound to beat.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (26)
  1. Statistical mechanics of complex networks. Reviews of modern physics, 74(1):47, 2002.
  2. Automatic conjecturing of p-recursions using lifted inference. In Inductive Logic Programming: 30th International Conference, ILP 2021, Virtual Event, October 25–27, 2021, Proceedings, page 17–25, Berlin, Heidelberg, 2021. Springer-Verlag.
  3. Symmetric weighted first-order model counting. In Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS ’15, page 313–328, New York, NY, USA, 2015. Association for Computing Machinery.
  4. Lifted junction tree algorithm. In KI 2016: Advances in Artificial Intelligence: 39th Annual German Conference on AI, Klagenfurt, Austria, September 26-30, 2016, Proceedings 39, pages 30–42. Springer, 2016.
  5. Lifted first-order probabilistic inference. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, pages 1319–1325. Morgan Kaufmann San Francisco, 2005.
  6. Synthesising recursive functions for first-order model counting: Challenges, progress, and conjectures. In Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, KR 2023, Rhodes, Greece, September 2-8, 2023, pages 198–207, 2023.
  7. Probabilistic theorem proving. In Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence, UAI’11, page 256–265, Arlington, Virginia, USA, 2011. AUAI Press.
  8. Herbrand logic. Technical Report LG-2006-02, Stanford University, Stanford, CA, 2006. http://logic.stanford.edu/reports/LG-2006-02.pdf.
  9. Lifted inference seen from the other side: The tractable features. Advances in Neural Information Processing Systems, 23, 2010.
  10. New liftable classes for first-order probabilistic inference. In Proceedings of the 30th International Conference on Neural Information Processing Systems, NIPS’16, page 3125–3133, Red Hook, NY, USA, 2016. Curran Associates Inc.
  11. Weighted model counting beyond two-variable logic. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, pages 619–628, 2018.
  12. Ondřej Kuželka. Weighted first-order model counting in the two-variable fragment with counting quantifiers. Journal of Artificial Intelligence Research, 70:1281–1307, 2021.
  13. Weighted first order model counting with directed acyclic graph axioms. ArXiv, abs/2302.09830, 2023.
  14. Lifted inference beyond first-order logic. ArXiv, abs/2308.11738, 2023.
  15. Lifted inference for probabilistic logic programs. Technical report, KU Leuven and University of California, 2014.
  16. A relaxed tseitin transformation for weighted model counting. In International Workshop on Statistical Relational AI, February 2016.
  17. David Poole. First-order probabilistic inference. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, volume 3, pages 985–991, 2003.
  18. Markov logic networks. Machine Learning, 62(1–2):107–136, feb 2006.
  19. On discovering interesting combinatorial integer sequences. In Edith Elkind, editor, Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI-23, pages 3338–3346. International Joint Conferences on Artificial Intelligence Organization, 8 2023. Main Track.
  20. Lifted variable elimination: Decoupling the operators from the constraint language. Journal of Artificial Intelligence Research, 47:393–439, 2013.
  21. Lifted inference with linear order axiom. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 37(10), pages 12295–12304, 2023.
  22. Timothy van Bremen and Ondřej Kuželka. Faster lifting for two-variable logic using cell graphs. In Cassio de Campos and Marloes H. Maathuis, editors, Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, volume 161 of Proceedings of Machine Learning Research, pages 1393–1402. PMLR, 27–30 Jul 2021.
  23. Timothy van Bremen and Ondřej Kuželka. Lifted inference with tree axioms. In Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, pages 599–608, 11 2021.
  24. Lifted probabilistic inference by first-order knowledge compilation. In Toby Walsh, editor, Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI), pages 2178–2185. AAAI Press/International Joint Conferences on Artificial Intelligence, 2011.
  25. Skolemization for weighted first-order model counting. In Proceedings of the Fourteenth International Conference on Principles of Knowledge Representation and Reasoning, KR’14, page 111–120. AAAI Press, 2014.
  26. Guy Van den Broeck. On the completeness of first-order knowledge compilation for lifted probabilistic inference. In Proceedings of the 24th International Conference on Neural Information Processing Systems, NIPS’11, page 1386–1394, Red Hook, NY, USA, 2011. Curran Associates Inc.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now