Research map / Learning theory and algorithms / Combinatorial and search optimization
Polynomial-Time Probabilistic Reasoning with Partial Observations via Implicit Learning in Probability Logics
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- On the Hardness of Approximating Distributions with Tractable Probabilistic Models (NeurIPS 2025 · similarity 0.84)
- On the Expressive Power of Tree-Structured Probabilistic Circuits (NeurIPS 2024 · similarity 0.84)
- An Algebraic Notion of Conditional Independence, and Its Application to Knowledge Representation (AAAI 2025 · similarity 0.84)
- Decomposing Constraint Networks for Calculating c-Representations (AAAI 2024 · similarity 0.84)
- On the Hardness of Probabilistic Neurosymbolic Learning (ICML 2024 · similarity 0.84)
- From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy (ICLR 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.