Research map / Learning theory and algorithms / Combinatorial and search optimization
Weighted Model Counting in FO2 with Cardinality Constraints and Counting Quantifiers: A Closed Form Formula
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use lifted interpretations to formulate closed-form model counting | Universally quantified FO2 · FO2 | domain-liftability | Helped |
| Add combinatorial cardinality constraints over unary and binary predicates | Lifted-interpretation model counting · FO2 with cardinality constraints | domain-liftability | Helped |
| Apply inclusion-exclusion to handle existential quantifiers and counting quantifiers | Lifted-interpretation model counting · FO2 with existential quantifiers and C2 | domain-liftability | Helped |
| Define weights over lifted type-count vectors instead of restricting to symmetric weights | Weighted model counting for FO2 · FO2 count distributions | expressivity | Helped |
Closest papers by meaning
- An Approximate Skolem Function Counter (AAAI 2024 · similarity 0.86)
- Spectra of Cardinality Queries over Description Logic Knowledge Bases (AAAI 2025 · similarity 0.85)
- Engineering an Exact Pseudo-Boolean Model Counter (AAAI 2024 · similarity 0.84)
- Complete Symmetry Breaking for Finite Models (AAAI 2025 · similarity 0.84)
- The Gradient of Algebraic Model Counting (AAAI 2025 · similarity 0.84)
- Submodel Enumeration for CTL Is Hard (AAAI 2024 · similarity 0.83)
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.