The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Task modeling with reusable problem-solving methods
Open accessAbstract
Problem-solving methods for knowledge-based systems establish the behavior of such systems by defining the roles in which domain knowledge is used and the ordering of inferences. Developers can compose problem-solving methods that accomplish complex application tasks from primitive, reusable methods. The key steps in this development approach are task analysis, method selection (from a library), and method configuration. Protégé-ii is a knowledge-engineering environment that allows developers to select and configure problem-solving methods. In addition, Protégé-ii generates domain-specific knowledge-acquisition tools that domain specialists can use to create knowledge bases on which the methods may operate. The board-game method is a problem-solving method that defines control knowledge for a class of tasks that developers can model in a highly specific way. The method adopts a conceptual model of problem solving in which the solution space is construed as a “game board” on which the problem solver moves “playing pieces” according to prespecified rules. This familiar conceptual model simplifies the developer's cognitive demands when configuring the board-game method to support new application tasks. We compare configuration of the board-game method to that of a chronological-backtracking problem-solving method for the same application tasks (for example, towers of Hanoi and the Sisyphus room-assignment problem). We also examine how method designers can specialize problem-solving methods by making ontological commitments to certain classes of tasks. We exemplify this technique by specializing the chronological-backtracking method to the board-game method.
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
Clancey, W. J. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90016-5 · Cited by 880
Cited by
Knowledge engineering: Principles and methods
Studer, R., Benjamins, V. R., & Fensel, D. (1998) · Data & Knowledge Engineering · doi:10.1016/s0169-023x(97)00056-6 · Cited by 3,686
The protégé project: a look back and a look forward
Musen, M. A. (2015) · AI Matters · doi:10.1145/2757001.2757003 · Cited by 1,411
Self-citationThe evolution of Protégé: an environment for knowledge-based systems development
Gennari, J. H., Musen, M. A., Fergerson, R. W., Grosso, W. E., Crubézy, M., Eriksson, H., Noy, N. F., & Tu, S. W. (2003) · International Journal of Human-Computer Studies · doi:10.1016/s1071-5819(02)00127-1 · Cited by 1,137
Self-citationA Framework for Knowledge-Based Temporal Abstraction
Shahar, Y. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(96)00025-2 · Cited by 461
“Methods decompose tasks into subtasks, which can be solved by other methods or by mechanisms, which are defined as nondecomposable methods [Eriksson et al., 1995].”
BackgroundMethodInfluentialShahar, Y., Miksch, S., & Johnson, P. (1998) · Artificial Intelligence in Medicine · doi:10.1016/s0933-3657(98)00015-3 · Cited by 452
Self-citation
Metadata
- Authors
- Eriksson, H., Shahar, Y., Tu, S. W., Puerta, A. R., & Musen, M. A.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 1995-12
- Volume
- 79
- Issue
- 2
- Pages
- 293-326
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2166957636
- Cited by
- 159
- References
- 1
- FWCI
- 24.42
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: Task modeling with reusable problem-solving methods. https://app.cochat.ai/papers/10.1016/0004-3702(94)00040-9
- The paper
- Eriksson, H., Shahar, Y., Tu, S. W., Puerta, A. R., & Musen, M. A. (1995). Task modeling with reusable problem-solving methods. Artificial Intelligence. https://doi.org/10.1016/0004-3702(94)00040-9
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.