Research map / Learning theory and algorithms / Combinatorial and search optimization
Schematic Invariants by Reduction to Ground Invariants
Jussi Rintanen
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 |
|---|---|---|---|
| ground only a limited domain per type (Theorem 5) before running ground invariant algorithm | Rintanen 2014 invariant algorithm · IPC 2008/2011/2014 temporal | runtime: over 4 hours -> some seconds | Improved |
| reduce number of ground actions | Rintanen 2014 invariant algorithm · IPC temporal | runtime: never over 10 seconds at 250 actions; at most 3 seconds with 50 | Improved |
| limited grounding vs full grounding | schematic invariants · Crewplanning, Elevator, Openstacks | invariants found | Hurt |
Closest papers by meaning
- Symbolic Numeric Planning with Patterns (AAAI 2024 · similarity 0.83)
- Differentiable Learning of Lifted Action Schemas for Classical Planning (NeurIPS 2026 · similarity 0.83)
- Automatic Selection of Macro-Events for Heuristic-Search Temporal Planning (AAAI 2025 · similarity 0.82)
- PDBs Go Numeric: Pattern-Database Heuristics for Simple Numeric Planning (AAAI 2025 · similarity 0.81)
- A Syntactic Approach to Computing Complete and Sound Abstraction in the Situation Calculus (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.
