atlas

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

totSAT - Totally-Ordered Hierarchical Planning Through SAT

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

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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
use SAT-based totSAT instead of HTN2STRIPSHTN planning · 127 totally-ordered instancesinstances solved: 82 -> 125Helped
use totSAT instead of SHOPHTN planning · 127 instancesinstances solved: 92 -> 125Helped
swap SAT solver (cryptominisat5, MapleCOMSPS, Riss6, minisat) (ablation)totSAT · 127 instancesinstances solved: 123 to 125No clear effect
use plain minisat instead of cryptominisat5 (ablation)totSAT · TRANSPORTinstances solved: 28 -> 27Hurt
use plan-space heuristics (TDG) instead of blind BFSPANDA planners · 127 instancesinstances solved: 62 (BFS) vs 62 (TDG-c), 68 (TDG-m)Mixed
use totSAT instead of SHOP for solution lengthHTN planning · solution qualityextra actions vs optimal: +0.37 -> 0.58Hurt

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