Research map / Probabilistic and scientific modeling / Variational and generative sampling
Lifted Fact-Alternating Mutex Groups and Pruned Grounding of Classical Planning Problems
Daniel Fišer
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 |
|---|---|---|---|
| use improved inference H+ (multiple counted variables, type and counted-variable refinement, extending proved groups) instead of Helmert's H | lifted fam-group inference · IPC domains w/o conditional effects | avg cover number / facts: 0.42 -> 0.34 | Improved |
| use H+ instead of H | lifted fam-group inference · tetris | avg cover number / facts: 0.90 -> 0.04 | Improved |
| use H+ instead of H | pruned grounding · IPC problems | % operators removed with mutex + dead-end pruning: 3.78 -> 7.66 | Improved |
| use H+ instead of H | pruned grounding with h2 · IPC problems | % operators removed: 17.83 -> 21.28 | Improved |
| use H+ instead of H | pruned grounding mutex-only · IPC problems | % operators removed: 1.15 -> 1.25 | Improved |
| add dead-end operator pruning to unreachable-operator pruning | H+ · IPC problems | % operators removed: 1.25 -> 7.66 | Improved |
| use H+ instead of H | merge-and-shrink in Fast Downward · IPC optimal track | problems solved: 598 -> 618 | Improved |
| use H+ instead of H | Complementary2 · IPC optimal track | problems solved: 754 -> 775 | Improved |
| use H+ instead of H | Complementary1 · IPC optimal track | problems solved: 727 -> 742 | Improved |
| use H+ instead of H | LAMA-11 and FF satisficing · IPC satisficing track | problems solved: +2 for LAMA-11, -1 for FF | No clear effect |
| use H+ instead of H | A* with LM-Cut · IPC optimal track | problems solved: +3 barman, -1 transport | No clear effect |
Closest papers by meaning
- Homomorphisms of Lifted Planning Tasks: The Case for Delete-Free Relaxation Heuristics (AAAI 2022 · similarity 0.86)
- On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence (AAAI 2024 · similarity 0.83)
- An Automatic Sound and Complete Abstraction Method for Generalized Planning with Baggable Types (AAAI 2025 · similarity 0.82)
- Symbolic Numeric Planning with Patterns (AAAI 2024 · similarity 0.81)
- Counting and Reasoning with Plans (AAAI 2025 · similarity 0.81)
- Optimizing the Optimization of Planning Domains by Automatic Action Schema Splitting (AAAI 2024 · similarity 0.81)
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.
