Research map / Learning theory and algorithms / Combinatorial and search optimization
Lifted Inference with Linear Order Axiom
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 the ordered-chain graph with added shortcuts instead of a completely random graph | Watts-Strogatz-like MLN · Watts-Strogatz-like graph, n=10 | probability of extreme smoker counts | Helped |
| Increase the soft-rule weight | Watts-Strogatz-like MLN and random-graph MLN · Watts-Strogatz-like graph, n=10 | preference for extreme smoker counts | Helped |
| Use smaller soft-rule weights | Watts-Strogatz-like MLN and random-graph MLN · Watts-Strogatz-like graph, n=10 | agreement with the binomial distribution | Helped |
Closest papers by meaning
- Tractable Weighted First-Order Model Counting with Bounded Treewidth Binary Evidence (AAAI 2026 · similarity 0.90)
- Domain-Lifted Sampling for Universal Two-Variable Logic and Extensions (AAAI 2022 · similarity 0.90)
- New Liftable Classes for First-Order Probabilistic Inference (NeurIPS 2016 · similarity 0.89)
- Weighted Model Counting in FO2 with Cardinality Constraints and Counting Quantifiers: A Closed Form Formula (AAAI 2022 · similarity 0.89)
- An Approximate Skolem Function Counter (AAAI 2024 · similarity 0.86)
- The Gradient of Algebraic 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.