Research map / Probabilistic and scientific modeling / Variational and generative sampling
Scaling Relational Inference Using Proofs and Refutations
Ravi Mangal, Xin Zhang, Aditya Kamath, Aditya Nori, Mayur Naik
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 |
|---|---|---|---|
| add eager proof exploitation to lazy CPI (IPR1 vs CPI) (ablation) | LBX-based iterative solver · PA E3 | total time: – -> 114m | Improved |
| add eager proof exploitation (IPR1 vs CPI) (ablation) | LBX-based solver · PA E2 | total time: 235m -> 23m | Improved |
| add eager proof exploitation (IPR1 vs CPI) (ablation) | LBX-based solver · PA E2 | # iterations: 171 -> 8 | Improved |
| add eager proof exploitation (IPR1 vs CPI) (ablation) | LBX-based solver · RC E3 | total time: 150m -> 46m20s | Improved |
| add eager proof exploitation (IPR1 vs CPI) (ablation) | LBX-based solver · RC E3 | # ground clauses: 14M -> 4.5M | Improved |
| add eager proof exploitation (IPR1 vs CPI) (ablation) | LBX-based solver · AR E3 | total time: 141m -> 124m | No clear effect |
| add eager proof exploitation (IPR2 vs ROCKIT) (ablation) | GUROBI ILP-based solver · PA E2 | total time: 286m -> 150m | Improved |
| add eager proof exploitation (IPR2 vs ROCKIT) (ablation) | GUROBI ILP-based solver · PA E2 | # iterations: 185 -> 3 | Improved |
| add eager proof exploitation (IPR2 vs ROCKIT) (ablation) | GUROBI ILP-based solver · PA E3 | total time | No clear effect |
| use ILP solver GUROBI instead of WPMS solver LBX (IPR2 vs IPR1) | IPR · AR E3 | total time: 124m -> 2m1s | Improved |
| use ILP solver GUROBI instead of WPMS solver LBX (IPR2 vs IPR1) | IPR · RC E3 | total time: 46m20s -> 2m54s | Improved |
| use ILP solver GUROBI instead of WPMS solver LBX (IPR2 vs IPR1) | IPR · PA E3 | total time: 114m -> – | Hurt |
Closest papers by meaning
- The Impact of Literal Sorting on Cardinality Constraint Encodings (AAAI 2025 · similarity 0.84)
- Expressive Power of Deep Homomorphism Networks over Relational Databases (NeurIPS 2026 · similarity 0.84)
- Hardness of Random Reordered Encodings of Parity for Resolution and CDCL (AAAI 2024 · similarity 0.83)
- Solving Inequality Proofs with Large Language Models (NeurIPS 2025 · similarity 0.83)
- Think Smarter not Harder: Adaptive Reasoning with Inference Aware Optimization (ICML 2025 · similarity 0.83)
- Decomposing Constraint Networks for Calculating c-Representations (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.
