The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
The computational complexity of propositional STRIPS planning
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving
Fikes, R. E., & Nilsson, N. J. (1971) · Artificial Intelligence · doi:10.1016/0004-3702(71)90010-5 · Cited by 4,882
Relationships between nondeterministic and deterministic tape complexities
Savitch, W. J. (1970) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(70)80006-x · Cited by 1,366
Planning for conjunctive goals
Chapman, D. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90092-0 · Cited by 1,112
Where the really hard problems are
Cheeseman, P. C., Kanefsky, B., & Taylor, W. M. (1991) · Cited by 1,004
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Minton, S., Johnston, M. D., Philips, A. B., & Laird, P. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90007-k · Cited by 843
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
Micali, S., & Vazirani, V. V. (1980) · 21st Annual Symposium on Foundations of Computer Science (sfcs 1980) · doi:10.1109/sfcs.1980.12 · Cited by 822
Hard and easy distributions of SAT problems
Mitchell, D. G. M., Selman, B., & Levesque, H. J. (1992) · Cited by 799
Dean, T. L., & McDermott, D. V. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90061-0 · Cited by 393
Planning as search: A quantitative approach
Korf, R. E. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90051-8 · Cited by 363
Expressiveness and tractability in knowledge representation and reasoning1
Levesque, H. J., & Brachman, R. J. (1987) · Computational Intelligence · doi:10.1111/j.1467-8640.1987.tb00176.x · Cited by 320
Cited by
Artificial Intelligence: A New Synthesis
(1998) · Elsevier eBooks · doi:10.1016/c2009-0-27773-7 · Cited by 1,163
Decision-Theoretic Planning: Structural Assumptions and Computational Leverage
Boutilier, C., Dean, T., & Hanks, S. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.575 · Cited by 1,074
Knowledge Representation and Reasoning
(2024) · Encyclopedia of Computer Graphics and Games · doi:10.1007/978-3-031-23161-2_300700 · Cited by 819
A survey of computational complexity results in systems and control
Blondel, V. D., & Tsitsiklis, J. N. (2000) · Automatica · doi:10.1016/s0005-1098(00)00050-9 · Cited by 732
The Tractable Cognition Thesis
Van Rooij, I. (2008) · Cognitive Science · doi:10.1080/03640210801897856 · Cited by 285
Metadata
- Authors
- Bylander, T.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 1994-09
- Volume
- 69
- Issue
- 1-2
- Pages
- 165-204
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2061146398
- Cited by
- 865
- References
- 25
- FWCI
- 11.20
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The computational complexity of propositional STRIPS planning. https://app.cochat.ai/papers/10.1016/0004-3702(94)90081-7
- The paper
- Bylander, T. (1994). The computational complexity of propositional STRIPS planning. Artificial Intelligence. https://doi.org/10.1016/0004-3702(94)90081-7
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.