The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Integrating planning and learning: the PRODIGY architecture
Open accessAbstract
Planning is a complex reasoning task that is well suited for the study of improving performance and knowledge by learning, i.e. by accumulation and interpretation of planning experience. PRODIGY is an architecture that integrates planning with multiple learning mechanisms. Learning occurs at the planner's decision points and integration in PRODIGY is achieved via mutually interpretable knowledge structures. This article describes the PRODIGY planner, briefly reports on several learning modules developed earlier along the project, and presents in more detail two recently explored methods to learn to generate plans of better quality. We introduce the techniques, illustrate them with comprehensive examples, and show preliminary empirical results. The article also includes a retrospective discussion of the characteristics of the overall PRODIGY architecture and discusses their evolution within the goal of the project of building a large and robust integrated planning and learning system.
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 · cited 4×
“…programming problem solvers (Quinlan, 1990; Zelle and Mooney, 1993), special-purpose problem solvers (Mitchell et al., 1983; Langley, 1983), or other general-purpose linear problem solvers (Etzioni, 1990; Fikes and Nilsson, 1971; Leckie and Zukerman, 1991; Minton, 1988b; P´erez and Etzioni, 1992).”
BackgroundInfluentialPólya, G. (1945) · Cited by 3,006
How to Solve It: A New Aspect of Mathematical Method
Polya, G. (1945) · Princeton University Press eBooks · doi:10.1515/9781400828678 · Cited by 1,652
Learning Logical Definitions from Relations
Quinlan, J. R. (1990) · Machine Learning · doi:10.1023/a:1022699322624 · Cited by 1,644
Machine learning: An artificial intelligence approach
Hunt, E. (1983) · Journal of Mathematical Psychology · doi:10.1016/0022-2496(83)90037-8 · Cited by 1,349
Learning Efficient Classification Procedures and Their Application to Chess End Games
Quinlan, J. R. (1983) · Machine Learning · doi:10.1007/978-3-662-12405-5_15 · Cited by 1,178
Planning for conjunctive goals
Chapman, D. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90092-0 · Cited by 1,112
Machine learning: An artificial intelligence approach
Stefik, M. J. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90005-0 · Cited by 958
Tate, A. (1977) · International Joint Conference on Artificial Intelligence · Cited by 634
McAllester, D., & Rosenblitt, D. (1991) · Cited by 525
Chunking in Soar: The Anatomy of a General Learning Mechanism
Laird, J. E., Rosenbloom, P. S., & Newell, A. (1986) · Machine Learning · doi:10.1023/a:1022639103969 · Cited by 507
Learning by Experimentation: Acquiring and Refining Problem-Solving Heuristics
Mitchell, T. M., Utgoff, P. E., & Banerji, R. (1983) · Machine Learning · doi:10.1007/978-3-662-12405-5_6 · Cited by 337
Automatically generating abstractions for planning
Knoblock, C. A. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90069-8 · Cited by 329
Proceedings of the Eighth International Joint Conference on Artificial Intelligence
Bundy, A. (1983) · Cited by 302
Degano, P. (1983) · Pictorial Data Analysis · doi:10.1007/978-3-642-82017-5_12 · Cited by 265
Derivational Analogy in PRODIGY: Automating Case Acquisition, Storage, and Utilization
Veloso, M. M., & Carbonell, J. G. (1993) · Machine Learning · doi:10.1023/a:1022686910523 · Cited by 197
Self-citationLearning by analogical reasoning in general problem-solving
Veloso, M. (1992) · Defense Technical Information Center (DTIC) · Cited by 196
Self-citationLearning effective search control knowledge: an explanation-based approach
Minton, S., & Carbonell, J. (1988) · Cited by 194
Self-citationAutomatically Generating Abstractions for Planning
Knoblock, C. A. (1993) · doi:10.21236/ada269772 · Cited by 176
Theory and algorithms for plan merging
Foulser, D. E., Li, M., & Yang, Q. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90016-q · Cited by 149
Making compromises among antagonist constraints in a planner
Descotte, Y., & Latombe, J. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90053-0 · Cited by 141
PRODIGY4.0: The Manual and Tutorial
Carbonell, J. G., Blythe, J., Etzioni, O., Gil, Y., Joseph, R. L., Kahn, D., Knoblock, C. A., Minton, S., Perez, A., Reilly, S. N., et al. (1992) · doi:10.21236/ada253970 · Cited by 139
Self-citationR1-Soar: An Experiment in Knowledge-Intensive Programming in a Problem-Solving Architecture
Rosenbloom, P. S., Laird, J. E., McDermott, J. P., Newell, A., & Orciuch, E. (1985) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1985.4767703 · Cited by 125
Learning Search Control Knowledge
Minton, S. (1988) · Kluwer international series in engineering and computer science · doi:10.1007/978-1-4613-1703-6 · Cited by 118
Acquiring search-control knowledge via static analysis
Etzioni, O. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90080-u · Cited by 100
Learning Planning Operators by Observation and Practice.
Wang, X. (1994) · Cited by 91
A structural theory of explanation-based learning
Etzioni, O. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90035-a · Cited by 65
Acquiring domain knowledge for planning by experimentation
Gil, Y. (1992) · Defense Technical Information Center (DTIC) · Cited by 64
Linkability: examining causal link commitments in partial-order planning
Veloso, M., & Blythe, J. (1994) · Cited by 55
Self-citationCarbonell, J., & Gil, Y. (1990) · Elsevier eBooks · doi:10.1016/b978-0-08-051055-2.50013-4 · Cited by 55
Self-citationLazy explanation-based learning: a solution to the intractable theory problem
Tadepalli, P. V. (1989) · International Joint Conference on Artificial Intelligence · Cited by 53
Incremental learning of control knowledge for nonlinear problem solving
Borrajo, D., & Veloso, M. (1994) · Lecture notes in computer science · doi:10.1007/3-540-57868-4_51 · Cited by 35
Self-citationNonlinear problem solving using intelligent casual-commitment
Veloso, M. (2018) · KiltHub Repository · doi:10.1184/r1/6607757 · Cited by 30
Self-citationDYNAMIC: A new role for training problems in EBL
Pérez, M. A., & Etzioni, O. (1992) · Elsevier eBooks · doi:10.1016/b978-1-55860-247-2.50052-8 · Cited by 28
Formalizing the PRODIGY Planning Algorithm
Fink, E., & Veloso, M. (2018) · KiltHub Repository · doi:10.1184/r1/6605837 · Cited by 26
Self-citationHierarchical representation of problem-solving knowledge in a frame-based process planning system
Nau, D. S., & Chang, T. (1986) · International Journal of Intelligent Systems · doi:10.1002/int.4550010105 · Cited by 25
Why EBL Produces Overly-Specific Knowledge: A Critique of the PRODIGY Approaches
Etzioni, O., & Minton, S. (1992) · Elsevier eBooks · doi:10.1016/b978-1-55860-247-2.50023-1 · Cited by 22
Explanation-based generalization of partially ordered plans
Subbarao Kambhampati, B., & Kedar, S. T. (1991) · NASA Technical Reports Server (NASA) · Cited by 18
A planner with quality goal and its speed-up learning for optimization problem
Iwamoto, M. (1994) · Cited by 13
Learning Episodes for Optimization
Ruby, D., & Kibler, D. F. (1992) · Elsevier eBooks · doi:10.1016/b978-1-55860-247-2.50054-1 · Cited by 12
Cited by
Explainable, Normative, and Justified Agency
Langley, P. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33019775 · Cited by 25
Metadata
- Authors
- VELOSO, M., CARBONELL, J., PÉREZ, A., BORRAJO, D., FINK, E., & BLYTHE, J.
- Venue
- Journal of Experimental & Theoretical Artificial Intelligence
- Publisher
- Informa UK Limited
- Published
- 1995-01
- Volume
- 7
- Issue
- 1
- Pages
- 81-120
- ISSN
- 0952-813X (ISSN-L)
- 1362-3079
- OpenAlex
- W2035078485
- Cited by
- 367
- References
- 40
- FWCI
- 20.59
- Type
- journal article
- Language
- en
- Open access
- green
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.