The DOI matches its Crossref record; 72 of the 72 references it cites were found in a registry or an index.
Inductive Inference: Theory and Methods
Abstract
article Free Access Share on Inductive Inference: Theory and Methods Authors: Dana Angluin Department of Computer Science, Yale University, New Haven, Connecticut Department of Computer Science, Yale University, New Haven, ConnecticutView Profile , Carl H. Smith Department of Computer Science, The University of Maryland, College Park, Maryland Department of Computer Science, The University of Maryland, College Park, MarylandView Profile Authors Info & Claims ACM Computing SurveysVolume 15Issue 3Sept. 1983 pp 237–269https://doi.org/10.1145/356914.356918Published:01 September 1983Publication History 661citation4,077DownloadsMetricsTotal Citations661Total Downloads4,077Last 12 Months461Last 6 weeks74 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Proceedings of the 19th International Joint Conference on Artificial Intelligence
Pujol, J. M., Delgado, J., Ramon Sangüesa, A., & Flache, A. (2005) · International Joint Conference on Artificial Intelligence · Cited by 5,771
Language identification in the limit
Gold, E. M. (1967) · Information and Control · doi:10.1016/s0019-9958(67)91165-5 · Cited by 3,572
Laudan, L. (1977) · Cited by 2,048
Three approaches to the quantitative definition of information*
Kolmogorov, A. N. (1968) · International Journal of Computer Mathematics · doi:10.1080/00207166808803030 · Cited by 2,031
A formal theory of inductive inference. Part II
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90131-7 · Cited by 1,758
Formal Principles of Language Acquisition
Baker, C. L., Wexler, K., & Culicover, P. W. (1982) · Language · doi:10.2307/414105 · Cited by 1,513
Mitchell, T. M. (1982) · Artificial Intelligence · doi:10.1016/0004-3702(82)90040-6 · Cited by 1,412
The definition of random sequences
Martin-Löf, P. (1966) · Information and Control · doi:10.1016/s0019-9958(66)80018-9 · Cited by 1,220
A formal theory of inductive inference. Part I
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90223-2 · Cited by 1,192
Cited by
Landauer, T. K., & Dumais, S. T. (1997) · Psychological Review · doi:10.1037/0033-295x.104.2.211 · Cited by 6,282
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
“Angluin, D., Smith, C.H. Inductive inference: Theory and methods.”
BackgroundInfluentialWorkflow mining: discovering process models from event logs
van der Aalst, W., Weijters, T., & Maruster, L. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.47 · Cited by 2,203
Learning regular sets from queries and counterexamples
Angluin, D. (1987) · Information and Computation · doi:10.1016/0890-5401(87)90052-6 · Cited by 2,114
Self-citationAngluin, D. (1988) · Machine Learning · doi:10.1007/bf00116828 · Cited by 1,905
Self-citationConnectionist learning procedures
Hinton, G. E. (1989) · Artificial Intelligence · doi:10.1016/0004-3702(89)90049-0 · Cited by 1,430
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1987) · Information Processing Letters · doi:10.1016/0020-0190(87)90114-1 · Cited by 1,054
Discovering models of software processes from event-based data
Cook, J. E., & Wolf, A. L. (1998) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/287000.287001 · Cited by 870
The calculi of emergence: computation, dynamics and induction
Crutchfield, J. P. (1994) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(94)90273-9 · Cited by 754
On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
Amaldi, E., & Kann, V. (1998) · Theoretical Computer Science · doi:10.1016/s0304-3975(97)00115-1 · Cited by 753
Learning, invariance, and generalization in high-order neural networks
Giles, C. L., & Maxwell, T. (1987) · Applied Optics · doi:10.1364/ao.26.004972 · Cited by 676
Alur, R., Bodik, R., Juniwal, G., Martin, M. M. K., Raghothaman, M., Seshia, S. A., Singh, R., Solar-Lezama, A., Torlak, E., & Udupa, A. (2013) · 2013 Formal Methods in Computer-Aided Design · doi:10.1109/fmcad.2013.6679385 · Cited by 656
Process mining: a research agenda
van der Aalst, W. M. P., & Weijters, A. J. M. M. (2004) · Computers in Industry · doi:10.1016/j.compind.2003.10.001 · Cited by 652
Hinton, G. E. (1990) · Machine Learning · doi:10.1016/b978-0-08-051055-2.50029-8 · Cited by 516
Computational limitations on learning from examples
Pitt, L., & Valiant, L. G. (1988) · Journal of the ACM · doi:10.1145/48014.63140 · Cited by 515
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
Littlestone, N. (1988) · Machine Learning · doi:10.1007/bf00116827 · Cited by 497
Genetic process mining: an experimental evaluation
de Medeiros, A. K. A., Weijters, A. J. M. M., & van der Aalst, W. M. P. (2007) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-006-0061-7 · Cited by 490
A general framework for adaptive processing of data structures
Frasconi, P., Gori, M., & Sperduti, A. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/72.712151 · Cited by 471
Artificial neural network models of knowledge representation in chemical engineering
Hoskins, J. C., & Himmelblau, D. M. (1988) · Computers & Chemical Engineering · doi:10.1016/0098-1354(88)87015-7 · Cited by 415
Harman, G. (1999) · doi:10.1093/0198238029.001.0001 · Cited by 409
Learning and Extracting Finite State Automata with Second-Order Recurrent Neural Networks
Giles, C. L., Miller, C. B., Chen, D., Chen, H. H., Sun, G. Z., & Lee, Y. C. (1992) · Neural Computation · doi:10.1162/neco.1992.4.3.393 · Cited by 392
An information theoretic approach to rule induction from databases
Smyth, P., & Goodman, R. M. (1992) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.149926 · Cited by 356
Computational learning theory: survey and selected bibliography
Angluin, D. (1992) · Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 · doi:10.1145/129712.129746 · Cited by 316
Self-citationInput-output HMMs for sequence processing
Bengio, Y., & Frasconi, P. (1996) · IEEE Transactions on Neural Networks · doi:10.1109/72.536317 · Cited by 300
The induction of dynamical recognizers
Pollack, J. B. (1991) · Machine Learning · doi:10.1007/bf00114845 · Cited by 294
Simplifying fuzzy rule-based models using orthogonal transformation methods
Yen, J., & Wang, L. (1999) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.740162 · Cited by 293
Bell, T., Witten, I. H., & Cleary, J. G. (1989) · ACM Computing Surveys · doi:10.1145/76894.76896 · Cited by 261
Generalized subsumption and its applications to induction and redundancy
Buntine, W. (1988) · Artificial Intelligence · doi:10.1016/0004-3702(88)90001-x · Cited by 168
One model for the learning of language
Yang, Y., & Piantadosi, S. T. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2021865119 · Cited by 50
Combining Induction, Deduction, and Structure for Verification and Synthesis
Seshia, S. A. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2471838 · Cited by 38
“2 Machine learning algorithms are typically inductive, generalizing from (labeled) examples to obtain a learned concept or classifier [19], [20].”
Background(2003) · doi:10.71910/supsi.7059 · Cited by 11
Valiant, L. G. (2026) · Foundations of Computation and Machine Learning · doi:10.1145/3749740.3749746
Metadata
- Authors
- Angluin, D., & Smith, C. H.
- Venue
- ACM Computing Surveys
- Published
- 1983-09
- Volume
- 15
- Issue
- 3
- Pages
- 237-269
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2061079066
- Cited by
- 887
- References
- 72
- FWCI
- 12.34
- 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.