The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Planning for temporally extended goals
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
The Temporal Logic of Reactive and Concurrent Systems
Manna, Z., & Pnueli, A. (1992) · Springer eBooks · doi:10.1007/978-1-4612-0931-7 · Cited by 2,958
EMERSON, E. A. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50021-4 · Cited by 2,585
The Temporal Logic of Reactive and Concurrent Systems: Specification
Pnueli, A., & Manna, Z. (1991) · Cited by 1,352
The benefits of relaxing punctuality
Alur, R., Feder, T., & Henzinger, T. A. (1991) · Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 · doi:10.1145/112600.112613 · Cited by 679
UCPOP: a sound, complete, partial order planner for ADL
Penberthy, J. S., & Weld, D. S. (1992) · Cited by 676
ADL: exploring the middle ground between STRIPS and the situation calculus
Pednault, E. (1989) · Principles of Knowledge Representation and Reasoning · Cited by 479
Universal plans for reactive robots in unpredictable environments
Schoppers, M. (1987) · Cited by 476
Green, C. (1981) · Readings in Artificial Intelligence · doi:10.1016/b978-0-934613-03-3.50019-2 · Cited by 456
O-Plan: The open planning architecture
Currie, K., & Tate, A. (1991) · Artificial Intelligence · doi:10.1016/0004-3702(91)90024-e · Cited by 407
Planning in Time: Windows and Durations for Activities and Goals
Vere, S. A. (1983) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1983.4767389 · Cited by 382
Application of Theorem Proving to Problem Solving
Green, C. (1969) · doi:10.21236/ada459656 · Cited by 289
Brachman, R. J., Allen, J. F., Kautz, H., et al. (1991) · Medical Entomology and Zoology · Cited by 259
Model Checking vs. Theorem Proving: A Manifesto
Halpern, J. Y., & Vardi, M. Y. (1991) · Elsevier eBooks · doi:10.1016/b978-0-12-450010-5.50015-3 · Cited by 190
Planning with deadlines in stochastic domains
Dean, T., Kaelbling, L. P., Kirman, J., & Nicholson, A. E. (1993) · Cited by 183
Temporal planning with continuous change
Penberthy, J. S., & Weld, D. S. (1994) · Cited by 157
Using temporal logic to control search in a forward chaining planner
Bacchus, F., & Kabanza, F. (1996) · IOS Press eBooks · Cited by 115
Self-citationPlan synthesis: a logical perspective
Rosenschein, S. J. (1981) · International Joint Conference on Artificial Intelligence · Cited by 109
Drummond, M. (1989) · Cited by 100
Using abstractions for decision-theoretic planning with time constraints
Boutilier, C. E., & Dearden, R. (1994) · Cited by 90
Weld, D. S., & Etzioni, O. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04879-1_7 · Cited by 88
Utility Models for Goal‐Directed, Decision‐Theoretic Planners
Haddawy, P., & Hanks, S. (1998) · Computational Intelligence · doi:10.1111/0824-7935.00068 · Cited by 83
Tractable Closed World Reasoning with Updates
Etzioni, O., Golden, K., & Weld, D. S. (1994) · Principles of Knowledge Representation and Reasoning · doi:10.1016/b978-1-4832-1452-8.50113-5 · Cited by 76
Control strategies for a stochastic planner
Tash, J. K., & Russell, S. (1994) · Cited by 43
Cited by
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
Fox, M., & Long, D. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1129 · Cited by 1,741
Knowledge Representation and Reasoning
(2024) · Encyclopedia of Computer Graphics and Games · doi:10.1007/978-3-031-23161-2_300700 · Cited by 819
Gerevini, A. E., Haslum, P., Long, D., Saetti, A., & Dimopoulos, Y. (2009) · Artificial Intelligence · doi:10.1016/j.artint.2008.10.012 · Cited by 295
Metadata
- Authors
- Bacchus, F., & Kabanza, F.
- Venue
- Annals of Mathematics and Artificial Intelligence
- Published
- 1998-02
- Volume
- 22
- Issue
- 1-2
- Pages
- 5-27
- ISSN
- 1012-2443 (ISSN-L)
- 1573-7470
- OpenAlex
- W1552135236
- Cited by
- 276
- References
- 24
- FWCI
- 15.75
- 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
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.