Research map / Learning theory and algorithms / Combinatorial and search optimization
Probabilistic Inference for Predicate Constraint Satisfaction
Yuki Satake, Hiroshi Unno, Hinata Yanagi
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 |
|---|---|---|---|
| increase candidate solutions per iteration from 1 to 8 with SID (ablation) | PCSAT · SyGuS-Comp 2018 InvTrack (127 linear CHCs) | SAT instances solved: 91 -> 100 | Improved |
| increase candidate solutions from 8 to 64 with SID (ablation) | PCSAT · SyGuS-Comp 2018 InvTrack (127 linear CHCs) | SAT instances solved: 100 -> 94 | Hurt |
| use SID (survey inspired decimation) instead of plain SAT enumeration at #cand=8 (ablation) | PCSAT · SyGuS-Comp 2018 InvTrack (127 linear CHCs) | SAT instances solved: 89 -> 100 | Improved |
| use SID with #cand=1 instead of plain SAT with #cand=1 (ablation) | PCSAT · SyGuS-Comp 2018 InvTrack (127 linear CHCs) | SAT instances solved: 94 -> 91 | No clear effect |
| increase #cand for plain SAT enumeration from 1 to 8 (ablation) | PCSAT without SID · SyGuS-Comp 2018 InvTrack (127 linear CHCs) | SAT instances solved: 94 -> 89 | Hurt |
| increase #cand with SID from 1 to 8 (ablation) | PCSAT · SyGuS-Comp 2018 InvTrack (127 linear CHCs) | avg CEGIS iterations on commonly solved: 15.980 -> 10.663 | Improved |
| increase #cand with SID from 1 to 8 (ablation) | PCSAT · SyGuS-Comp 2018 InvTrack (127 linear CHCs) | avg elapsed time on commonly solved (sec): 6.246 -> 6.201 | Mixed |
Closest papers by meaning
- On the Modelling of Constraints with Tractable Logical Operators (AAAI 2025 · similarity 0.86)
- The Impact of Literal Sorting on Cardinality Constraint Encodings (AAAI 2025 · similarity 0.85)
- From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy (ICLR 2025 · similarity 0.84)
- Logic.py: Bridging the Gap between LLMs and Constraint Solvers (NeurIPS 2025 · similarity 0.83)
- Decomposing Constraint Networks for Calculating c-Representations (AAAI 2024 · similarity 0.83)
- CRANE: Reasoning with constrained LLM generation (ICML 2025 · 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.
