Research map / Learning theory and algorithms / Combinatorial and search optimization
Tractable Weighted First-Order Model Counting with Bounded Treewidth Binary Evidence
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
- Weighted Model Counting in FO2 with Cardinality Constraints and Counting Quantifiers: A Closed Form Formula (AAAI 2022 · similarity 0.90)
- Engineering an Exact Pseudo-Boolean Model Counter (AAAI 2024 · similarity 0.87)
- Model Counting and Sampling via Semiring Extensions (AAAI 2024 · similarity 0.86)
- Towards Real-Time Approximate Counting (AAAI 2025 · similarity 0.86)
- An Approximate Skolem Function Counter (AAAI 2024 · similarity 0.86)
- Towards Projected and Incremental Pseudo-Boolean Model Counting (AAAI 2025 · similarity 0.85)
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.