AI Paper Atlas

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

Two Constraint Compilation Methods for Lifted Planning

Periklis Mantenoglou, Luigi Bonassi, Enrico Scala, Pedro Zuidberg Dos Martires

AAAI 2026 · Learning theory and algorithms › Combinatorial and search optimization · approach: Classical and HTN planning

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
compile without grounding (LCC/LiftedTCORE instead of TCORE)constraint compilation · Ground constraintsavg compiled actions: 21K -> 7 (LiftedTCORE), 8 (LCC)Improved
compile without grounding (LCC/LiftedTCORE instead of TCORE)constraint compilation · Ground constraintscompilation time (s): 4.518 -> 0.023 / 0.003Improved
use LCC instead of TCORELAMA · IPC benchmarkcoverage: 245 -> 246No clear effect
use LiftedTCORE instead of TCORELAMA · IPC benchmarkcoverage: 245 -> 238No clear effect
use LCC instead of LTL-CLAMA · IPC benchmarkcoverage: 158 -> 246Improved
use LiftedTCORE (lifted regression) instead of LCCLAMA · IPC benchmarknode expansions / runtimeImproved
use LiftedTCORE instead of LCC on non-ground constraintsLAMA · Non-Groundcoverage: LCC 246 vs LiftedTCORE 238 overallHurt
use lifted compilers instead of TCORE on problems with many constraintsLAMA · hundreds of constraintsplanning performanceHurt

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