Document Open Access Logo

The Existential Theory of the Reals with Summation Operators

Authors Markus Bläser , Julian Dörfler , Maciej Liśkiewicz , Benito van der Zander

PDF
Thumbnail PDF

File

LIPIcs.ISAAC.2024.13.pdf
  • Filesize: 0.93 MB
  • 19 pages

Document Identifiers

Author Details

Markus Bläser
  • Saarland University, Saarbrücken, Germany
Julian Dörfler
  • Saarland University, Saarbrücken, Germany
Maciej Liśkiewicz
  • University of Lübeck, Germany
Benito van der Zander
  • University of Lübeck, Germany

Funding

  • van der Zander, Benito: Work supported by the Deutsche Forschungsgemeinschaft (DFG) grant 471183316 (ZA 1244/1-1).

Cite As Get BibTex

Markus Bläser, Julian Dörfler, Maciej Liśkiewicz, and Benito van der Zander. The Existential Theory of the Reals with Summation Operators. In 35th International Symposium on Algorithms and Computation (ISAAC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 322, pp. 13:1-13:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.ISAAC.2024.13

Abstract

To characterize the computational complexity of satisfiability problems for probabilistic and causal reasoning within Pearl’s Causal Hierarchy, van der Zander, Bläser, and Liśkiewicz [IJCAI 2023] introduce a new natural class, named succ-∃ℝ. This class can be viewed as a succinct variant of the well-studied class ∃ℝ based on the Existential Theory of the Reals (ETR). Analogously to ∃ℝ, succ-∃ℝ is an intermediate class between NEXP and EXPSPACE, the exponential versions of NP and PSPACE.
The main contributions of this work are threefold. Firstly, we characterize the class succ-∃ℝ in terms of nondeterministic real Random-Access Machines (RAMs) and develop structural complexity theoretic results for real RAMs, including translation and hierarchy theorems. Notably, we demonstrate the separation of ∃ℝ and succ-∃ℝ. Secondly, we examine the complexity of model checking and satisfiability of fragments of existential second-order logic and probabilistic independence logic. We show succ-∃ℝ-completeness of several of these problems, for which the best-known complexity lower and upper bounds were previously NEXP-hardness and EXPSPACE, respectively. Thirdly, while succ-∃ℝ is characterized in terms of ordinary (non-succinct) ETR instances enriched by exponential sums and a mechanism to index exponentially many variables, in this paper, we prove that when only exponential sums are added, the corresponding class ∃ℝ^Σ is contained in PSPACE. We conjecture that this inclusion is strict, as this class is equivalent to adding a VNP-oracle to a polynomial time nondeterministic real RAM. Conversely, the addition of exponential products to ETR, yields PSPACE. Furthermore, we study the satisfiability problem for probabilistic reasoning, with the additional requirement of a small model, and prove that this problem is complete for ∃ℝ^Σ.

Subject Classification

ACM Subject Classification
  • Theory of computation → Complexity classes
Keywords
  • Existential theory of the real numbers
  • Computational complexity
  • Probabilistic logic
  • Models of computation
  • Existential second order logic

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Mikkel Abrahamsen, Anna Adamaszek, and Tillmann Miltzow. The art gallery problem is ∃ℝ-complete. In Proc. of the 50th ACM SIGACT Symposium on Theory of Computing (STOC 2018), pages 65-73, 2018. URL: https://doi.org/10.1145/3188745.3188868.
  2. Mikkel Abrahamsen, Linda Kleist, and Tillmann Miltzow. Training neural networks is ∃ℝ-complete. In Proc. Advances in Neural Information Processing Systems (NeurIPS 2021), pages 18293-18306, 2021. Google Scholar
  3. Elias Bareinboim, Juan D. Correa, Duligur Ibeling, and Thomas Icard. On Pearl’s Hierarchy and the Foundations of Causal Inference, pages 507-556. Association for Computing Machinery, New York, NY, USA, 2022. URL: https://doi.org/10.1145/3501714.3501743.
  4. Vittorio Bilò and Marios Mavronicolas. ∃ℝ-complete decision problems about symmetric Nash equilibria in symmetric multi-player games. In Proc. 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. Google Scholar
  5. Lenore Blum, Mike Shub, and Steve Smale. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin of the American Mathematical Society, 21(1):1-46, 1989. Google Scholar
  6. Peter Bürgisser. Completeness and reduction in algebraic complexity theory, volume 7. Springer Science & Business Media, 2000. Google Scholar
  7. John Canny. Some algebraic and geometric computations in PSPACE. In Proc. of the 20th ACM Symposium on Theory of Computing (STOC 1988), pages 460-467. ACM, 1988. URL: https://doi.org/10.1145/62212.62257.
  8. Jean Cardinal. Computational geometry column 62. ACM SIGACT News, 46(4):69-78, 2015. URL: https://doi.org/10.1145/2852040.2852053.
  9. Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, and Jonni Virtema. Probabilistic team semantics. In Foundations of Information and Knowledge Systems: 10th International Symposium, FoIKS 2018, Proceedings 10, pages 186-206. Springer, 2018. URL: https://doi.org/10.1007/978-3-319-90050-6_11.
  10. Jeff Erickson, Ivor Van Der Hoog, and Tillmann Miltzow. Smoothing the gap between NP and ER. SIAM Journal on Computing, pages FOCS20-102, 2022. Google Scholar
  11. Ronald Fagin, Joseph Y Halpern, and Nimrod Megiddo. A logic for reasoning about probabilities. Information and Computation, 87(1-2):78-128, 1990. URL: https://doi.org/10.1016/0890-5401(90)90060-U.
  12. Jugal Garg, Ruta Mehta, Vijay V Vazirani, and Sadra Yazdanbod. ∃ℝ-completeness for decision versions of multi-player (symmetric) Nash equilibria. ACM Transactions on Economics and Computation (TEAC), 6(1):1-23, 2018. URL: https://doi.org/10.1145/3175494.
  13. George Georgakopoulos, Dimitris Kavvadias, and Christos H. Papadimitriou. Probabilistic satisfiability. Journal of Complexity, 4(1):1-11, 1988. URL: https://doi.org/10.1016/0885-064X(88)90006-4.
  14. Dima Grigoriev and Nicolai N. Vorobjov Jr. Solving systems of polynomial inequalities in subexponential time. J. Symb. Comput., 5(1/2):37-64, 1988. URL: https://doi.org/10.1016/S0747-7171(88)80005-1.
  15. Miika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, and Jonni Virtema. Logics with probabilistic team semantics and the boolean negation. arXiv preprint arXiv:2306.00420, 2023. URL: https://doi.org/10.48550/arXiv.2306.00420.
  16. Miika Hannula, Juha Kontinen, Jan Van den Bussche, and Jonni Virtema. Descriptive complexity of real computation and probabilistic independence logic. In Proc. of the 35th ACM/IEEE Symposium on Logic in Computer Science (LICS 2020), pages 550-563, 2020. URL: https://doi.org/10.1145/3373718.3394773.
  17. Duligur Ibeling and Thomas Icard. Probabilistic reasoning across the causal hierarchy. In Proc. 34th AAAI Conference on Artificial Intelligence (AAAI 2020), pages 10170-10177. AAAI Press, 2020. URL: https://doi.org/10.1609/AAAI.V34I06.6577.
  18. Michael L. Littman, Judy Goldsmith, and Martin Mundhenk. The computational complexity of probabilistic planning. Journal of Artificial Intelligence Research, 9:1-36, 1998. URL: https://doi.org/10.1613/JAIR.505.
  19. Meena Mahajan. Algebraic complexity classes. Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume, pages 51-75, 2014. Google Scholar
  20. Colin McDiarmid and Tobias Müller. Integer realizations of disk and segment graphs. Journal of Combinatorial Theory, Series B, 103(1):114-143, 2013. URL: https://doi.org/10.1016/J.JCTB.2012.09.004.
  21. Milan Mossé, Duligur Ibeling, and Thomas Icard. Is causal reasoning harder than probabilistic reasoning? The Review of Symbolic Logic, pages 1-26, 2022. Google Scholar
  22. Nils J. Nilsson. Probabilistic logic. Artificial Intelligence, 28(1):71-87, 1986. URL: https://doi.org/10.1016/0004-3702(86)90031-7.
  23. Judea Pearl. Causality. Cambridge University Press, 2009. Google Scholar
  24. James Renegar. On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals. Journal of symbolic computation, 13(3):255-299, 1992. URL: https://doi.org/10.1016/S0747-7171(10)80003-3.
  25. Marcus Schaefer. Complexity of some geometric and topological problems. In Proc. International Symposium on Graph Drawing (GD 2009), pages 334-344. Springer, 2009. URL: https://doi.org/10.1007/978-3-642-11805-0_32.
  26. Marcus Schaefer, Jean Cardinal, and Tillmann Miltzow. The existential theory of the reals as a complexity class: A compendium. arXiv preprint, 2024. URL: https://doi.org/10.48550/arXiv.2407.18006.
  27. Marcus Schaefer and Daniel Štefankovič. Beyond the existential theory of the reals. Theory of Computing Systems, 68(2):195-226, 2024. URL: https://doi.org/10.1007/S00224-023-10151-X.
  28. Ilya Shpitser and Judea Pearl. Complete identification methods for the causal hierarchy. Journal of Machine Learning Research, 9:1941-1979, 2008. URL: https://doi.org/10.5555/1390681.1442797.
  29. Alfred Tarski. A decision method for elementary algebra and geometry. Journal of Symbolic Logic, 14(3), 1949. Google Scholar
  30. Seinosuke Toda. PP is as hard as the Polynomial-Time Hierarchy. SIAM Journal on Computing, 20(5):865-877, 1991. URL: https://doi.org/10.1137/0220053.
  31. Benito van der Zander, Markus Bläser, and Maciej Liśkiewicz. The hardness of reasoning about probabilities and causality. In Proc. Joint Conference on Artificial Intelligence (IJCAI 2023), 2023. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact