Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 178

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Programming by Demonstration Using Version Space Algebra

Open access
Lau, Tessa, Wolfman, Steven A., Domingos, Pedro, Weld, Daniel S.·2003·Machine Learning

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1023/a:1025671410623

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 3 references

Research works printed but not linked: 49

  1. Agre, P., & Chapman, D. (1990). What are plans for? Robotics and Autonomous Systems, 6:1/2, 17–34. · DOI · Paper page
  2. Andreae, P. (1984). Constraint limited generalization: Acquiring procedures from examples. In Proceedings of the Fourth National Conference on Artificial Intelligence (pp. 6–10).
  3. Ashish, N., & Knoblock, C. (1997). Semi-automatic wrapper generation for internet information sources. In Proceedings of the Second IFCIS International Conference on Cooperative Information Systems (pp. 160–169). Los Alamitos, CA. · doi:10.1109/coopis.1997.613813
  4. Bauer, M., & Dengler, D. (1999). TrIAs: Trainable information assistants for cooperative problem solving. In Proceedings of the Third Annual Conference on Autonomous Agents (pp. 260–267). · doi:10.1145/301136.301207
  5. Bauer, M., Dengler, D., & Paul, G. (2000). Instructible information agents for web mining. In Proceedings of the 2000 Conference on Intelligent User Interfaces. · doi:10.1145/325737.325758
  6. Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. (1987). Occam's razor. Information Processing, 24:6, 377–380. · DOI · Paper page
  7. Charniak, E., & Goldman, R. (1991). A probablistic model of plan recognition. In Proceedings of the Ninth National Conference on Artificial Intelligence (Vol. 1, pp. 160–165).
  8. Charniak, E.,& Goldman, R. P. (1993). A Bayesian model of plan recognition. Artificial Intelligence, 64:1, 53–79. · DOI · Paper page
  9. Cowie, J., & Lehnert, W. (1996). Information extraction. C. ACM, 39:1, 80–91. · DOI · Paper page
  10. Cypher, A. (Ed.). (1993). Watch What I Do: Programming by Demonstration. Cambridge, MA: MIT Press.
  11. Etzioni, O., Hanks, S., Weld, D., Draper, D., Lesh, N., & Williamson, M. (1992). An approach to planning with incomplete information. In Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning (pp. 115–125).
  12. Halbert, D. C. (1993). SmallStar: Programming by demonstration in the desktop metaphor. In A. Cypher (Ed.), Watch What I Do: Programming by Demonstration (pp. 102–123). Cambridge, MA: MIT Press.
  13. Haussler, D. (1988). Quantifying inductive bias. Artificial Intelligence, 36:2, 177–221. · DOI · Paper page
  14. Hirsh, H. (1991). Theoretical underpinnings of version spaces. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (pp. 665–670).
  15. Hirsh, H., Mishra, N., & Pitt, L. (1997). Version spaces without boundary sets. In Proceedings of the Fourteenth National Conference on Artificial Intelligence (pp. 491–496).
  16. Hobbs, J. (1992). The generic information extraction system. In Proc. 4th Message Understanding Conf.
  17. Kautz, H. A., & Allen, J. F. (1986). Generalized plan recognition. In Proceedings of the Fifth National Conference on Artificial Intelligence (pp. 32–37).
  18. Kushmerick, N. (2000). Wrapper induction: Efficiency and expressiveness. Artificial Intelligence, 118:1/2, 15–68. · DOI · Paper page
  19. Kushmerick, N., Weld, D., & Doorenbos, R. (1997). Wrapper induction for information extraction. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (pp. 729–737).
  20. Langley, P., & Simon, H. A. (1995). Applications of machine learning and rule induction. Communications of the ACM, 38, 54–64. · DOI · Paper page
  21. Lau, T.,& Weld, D. S. (1999). Programming by demonstration: An inductive learning formulation. In Proceedings of the 1999 International Conference on Intelligent User Interfaces (IUI 99) (pp. 145–152). Redondo Beach, CA, USA. · DOI
  22. Lesh, N. (1997). Adaptive goal recognition. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence.
  23. Lesh, N. (1998). Scalable and adaptive goal recognition. Ph.D. thesis, University of Washington.
  24. Lesh, N., & Etzioni, O. (1995). A sound and fast goal recognizer. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (pp. 1704–1710).
  25. Lesh, N., & Etzioni, O. (1996). Scaling up goal recognition. In Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (pp. 178–189).
  26. Lesh, N., Rich, C., & Sidner, C. (1999). Using plan recognition in human-computer collaboration. In Proceedings of the Seventh Int. Conf. on User Modelling. Banff, Canada. · DOI
  27. Lieberman, H. (1998). Integrating user interface agents with conventional applications. In Proceedings of the 2000 Conference on Intelligent User Interfaces (pp. 39–46). San Francisco, CA. · doi:10.1145/268389.268397
  28. Lieberman, H. (Ed.). (2001). Your Wish is My Command: Giving Users the Power to Instruct their Software. Morgan Kaufmann.
  29. Maes, P., & Kozierok, R. (1993). Learning interface agents. In Proceedings of AAAI-93 (pp. 459–465).
  30. Masui, T., & Nakayama, K. (1994). Repeat and predict—Two keys to efficient text editing. In Conference on Human Factors in Computing Systems (CHI '94) (pp. 118–123). · doi:10.1145/259963.260323
  31. Maulsby, D., & Witten, I. H. (1997). Cima: An interactive concept learning system for end-user applications. Applied Artificial Intelligence, 11, 653–671. · doi:10.1080/088395197117975
  32. Mitchell, T. (1982). Generalization as search. Artificial Intelligence, 18, 203–226. · DOI · Paper page
  33. Mo, D. H. (1989). Learning text editing procedures from examples. Master's thesis, University of Calgary.
  34. Muslea, I., Minton, S., & Knoblock, C. A. (2000). Selective sampling with redundant views. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (pp. 621–626).
  35. Nix, R. P. (1985). Editing by example. ACMTransactions on Programming Languages and Systems, 7:4, 600–621. · DOI
  36. Norton, S. W., & Hirsh, H. (1992). Classifier learning from noisy data as probabilistic evidence combination. In Proceedings of the Tenth National Conference on Artificial Intelligence (pp. 141–146). Menlo Park, CA.
  37. Paynter, G. W. (2000). Automating iterative tasks with programming by demonstration. Ph.D. thesis, University of Waikato.
  38. Pollack, M. (1990). Plans as complex mental attitudes. In P. Cohen, J. Morgan, & M. Pollack (Eds.), Intentions in Communication (pp. 77–101). Cambridge, MA: MIT Press. · doi:10.7551/mitpress/3839.003.0007
  39. Pynadath, D. V., & Wellman, M. P. (2000). Probabilistic state-dependent grammars for plan recognition. In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI-2000) (pp. 507–514).
  40. Rich, C.,& Sidner, C. (1997). Segmented interaction history in a collaborative agent. In Third Int. Conf. Intelligent User Interfaces (pp. 23–30). · doi:10.1145/238218.238222
  41. Ruvini, J., & Dony, C. (2000). APE: Learning user's habits to automate repetitive tasks. In Proceedings of the 2000 Conference on Intelligent User Interfaces (pp. 229–232). New Orleans, LA. · doi:10.1145/325737.325854
  42. Schlimmer, J., & Hermens, L. (1993). Software agents: Completing patterns and constructing user interfaces. J. Artificial Intelligence Research, 61–89. · DOI
  43. Shavlik, J., & DeJong, G. (1987). An explanation-based approach to generalizing number. In Proceedings of IJCAI-87 (pp. 236–238).
  44. Subramanian, D., & Feigenbaum, J. (1986). Factorization in experiment generation. In Proceedings of the Fifth National Conference on Artificial Intelligence (pp. 518–522). Philadelphia, PA.
  45. VanLehn, K., & Ball,W. (1987). A version space approach to learning context-free grammars. Machine Learning, 2, 39–74. · DOI
  46. Vilain, M. (1990). Getting serious about parsing plans: A grammatical analysis of plan recognition. In Proceedings of the Eighth National Conference on Artificial Intelligence (pp. 190–197).
  47. Weld, D. (1994). An introduction to least-commitment planning. Artificial Intellligence Magazine, 15:4, 27–61. Available at ftp://ftp.cs.washington.edu/pub/ai/.
  48. Witten, I. H. (1995). Pbd systems: When will they ever learn? In Workshop on Programming by Demonstration, ML'95 (pp. 1–9). Tahoe City, CA.
  49. Wolfman, S. A., Lau, T., Domingos, P., & Weld, D. S. (2001). Collaborative interfaces for learning tasks: SMARTedit talks back. In Proceedings of the 2001 Conference on Intelligent User Interfaces (pp. 167–174). Santa Fe, NM, USA. · DOI

Cited by

See all 178

Metadata

Authors
Lau, T., Wolfman, S. A., Domingos, P., & Weld, D. S.
Venue
Machine Learning
Published
2003-10
Volume
53
Issue
1-2
Pages
111-156
ISSN
  • 0885-6125 (ISSN-L)
  • 1573-0565
OpenAlex
W1792831685
Cited by
178
References
3
FWCI
3.53
Type
journal article
Language
en
Open access
bronze
Licence

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: Programming by Demonstration Using Version Space Algebra. https://app.cochat.ai/papers/10.1023/a:1025671410623
The paper
Lau, T., Wolfman, S. A., Domingos, P., & Weld, D. S. (2003). Programming by Demonstration Using Version Space Algebra. Machine Learning. https://doi.org/10.1023/a%3A1025671410623

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.