AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Schematic Invariants by Reduction to Ground Invariants

Jussi Rintanen

AAAI 2017 · Learning theory and algorithms › Combinatorial and search optimization · approach: Classical and HTN planning · 9 citations (OpenAlex)

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 changedWhereMeasuredEffect
ground only a limited domain per type (Theorem 5) before running ground invariant algorithmRintanen 2014 invariant algorithm · IPC 2008/2011/2014 temporalruntime: over 4 hours -> some secondsImproved
reduce number of ground actionsRintanen 2014 invariant algorithm · IPC temporalruntime: never over 10 seconds at 250 actions; at most 3 seconds with 50Improved
limited grounding vs full groundingschematic invariants · Crewplanning, Elevator, Openstacksinvariants foundHurt

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy