Blocks World revisited
Open accessIntegrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Finding the truly optimal Blocks World solution remains NP-hard.
“however finding the truly optimal solution remains NP-hard.”
From Comment on The Illusion of Thinking: Understanding the Strengths and Limitations of Reasoning Models via the Lens of Problem Complexity (2025) · cites this paper as [5]
Near-optimal Blocks World solutions can be found in linear time using domain-specific algorithms.
“Slaney and Thi´ ebaux [5] demonstrated that near-optimal solutions can be found in linear time using domain-specific algorithms”
From Comment on The Illusion of Thinking: Understanding the Strengths and Limitations of Reasoning Models via the Lens of Problem Complexity (2025) · cites this paper as [5]
Cited by
Sorted by citations
A Survey on Multimodal Large Language Models for Autonomous Driving
Cui, C., Ma, Y., Cao, X., Ye, W., Zhou, Y., Liang, K., Chen, J., Lu, J., Yang, Z., Liao, K.-D., et al. (2024) · 2024 IEEE/CVF Winter Conference on Applications of Computer Vision Workshops (WACVW) · doi:10.1109/wacvw60836.2024.00106 · Cited by 369 · see citing works
- Authors
- Slaney, J., & Thiébaux, S.
- Affiliations
- Australian National University (AU)
- Commonwealth Scientific and Industrial Research Organisation (AU)
- Corresponding author
- Slaney, John
- ORCID
- Thiébaux, Sylvie
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 2001-01
- Volume
- 125
- Issue
- 1-2
- Pages
- 119-153
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2070183171
- Cited by
- 226
- References
- 0
- Citations by year
- 2026: 6 · 2025: 4 · 2024: 12 · 2023: 3 · 2022: 6 · 2021: 9 · 2020: 9 · 2019: 5 · 2018: 7 · 2017: 4 · 2016: 6 · 2015: 6 · 2014: 11 · 2013: 12 · 2012: 21
- FWCI
- 6.02
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Artificial Intelligence (publishedVersion)
- ANU Open Research (Australian National University) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
- Physical Sciences › Computer Science › Computer Networks and Communications › Constraint Satisfaction and Optimization
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Keywords
- blocks world, planning benchmarks, AI planners, plan quality
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
