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
Shapiro, E. Y. (1983) · doi:10.7551/mitpress/1192.001.0001 · Cited by 1,085
Syntactic pattern recognition and applications
Fu, K. (1968) · Medical Entomology and Zoology · Cited by 1,015
Learning Structural Descriptions From Examples
Winston, P. H. (1970) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 988
Query-by-Example: A data base language
Zloof, M. M. (1977) · IBM Systems Journal · doi:10.1147/sj.164.0324 · Cited by 877
Mathematics, Matter and Method: Philosophical Papers
Putnam, H. (1979) · Cambridge University Press eBooks · doi:10.1017/cbo9780511625268 · Cited by 872
A Theory of Program Size Formally Identical to Information Theory
Chaitin, G. J. (1975) · Journal of the ACM · doi:10.1145/321892.321894 · Cited by 849
A Machine-Independent Theory of the Complexity of Recursive Functions
Blum, M. (1967) · Journal of the ACM · doi:10.1145/321386.321395 · Cited by 829
Complexity of automaton identification from given data
Gold, E. M. (1978) · Information and Control · doi:10.1016/s0019-9958(78)90562-4 · Cited by 771
(1983) · Springer eBooks · doi:10.1007/978-3-662-12405-5 · Cited by 760
Inductive inference of formal languages from positive data
Angluin, D. (1980) · Information and Control · doi:10.1016/s0019-9958(80)90285-5 · Cited by 745
Self-citationToward a mathematical theory of inductive inference
Blum, L., & Blum, M. (1975) · Information and Control · doi:10.1016/s0019-9958(75)90261-2 · Cited by 670
Zvonkin, A. K., & Levin, L. A. (1970) · Russian Mathematical Surveys · doi:10.1070/rm1970v025n06abeh001269 · Cited by 665
Finding patterns common to a set of strings
Angluin, D. (1980) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(80)90041-0 · Cited by 616
Self-citationInference of Reversible Languages
Angluin, D. (1982) · Journal of the ACM · doi:10.1145/322326.322334 · Cited by 526
Self-citationOn the Synthesis of Finite-State Machines from Samples of Their Behavior
Biermann, A. W., & Feldman, J. A. (1972) · IEEE Transactions on Computers · doi:10.1109/tc.1972.5009015 · Cited by 510
Syntactic Methods in Pattern Recognition
Fu, K., & Айзерман, М. А. (1976) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/tsmc.1976.4309556 · Cited by 497
Dendral and meta-dendral: Their applications dimension
Buchanan, B. G., & Feigenbaum, E. A. (1978) · Artificial Intelligence · doi:10.1016/0004-3702(78)90010-3 · Cited by 470
Pattern Recognition as Rule-Guided Inductive Inference
Michalski, R. S. (1980) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1980.4767034 · Cited by 405
Human acquisition of concepts for sequential patterns.
Simon, H. A., & Kotovsky, K. (1963) · Psychological Review · doi:10.1037/h0043901 · Cited by 400
Complexity-based induction systems: Comparisons and convergence theorems
Solomonoff, R. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055913 · Cited by 388
An introduction to the general theory of algorithms
Machtey, M., & Young, P. R. (1978) · Cited by 340
Syntactic Pattern Recognition: An introduction
(1979) · Pattern Recognition · doi:10.1016/0031-3203(79)90009-8 · Cited by 290
An introduction to the general theory of algorithms
Romoortere, P. V. (1979) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(79)90040-5 · Cited by 264
On the complexity of minimum inference of regular sets
Angluin, D. (1978) · Information and Control · doi:10.1016/s0019-9958(78)90683-6 · Cited by 251
Self-citationFriedberg, R. M. (1958) · Journal of Symbolic Logic · doi:10.2307/2964290 · Cited by 247
BuchananBruce, G., & FeigenbaumEdward, A. (1978) · Cited by 246
A study of grammatical inference
Horning, J. J. (1969) · Defense Technical Information Center (DTIC) · Cited by 232
A Methodology for LISP Program Construction from Examples
Summers, P. D. (1977) · Journal of the ACM · doi:10.1145/321992.322002 · Cited by 219
Information-Theoretic Limitations of Formal Systems
Chaitin, G. J. (1974) · Journal of the ACM · doi:10.1145/321832.321839 · Cited by 216
Automatic Methods of Inductive Inference
Plotkin, G. D. (1972) · ERA · Cited by 203
Some decidability results on grammatical inference and complexity
Feldman, J. (1972) · Information and Control · doi:10.1016/s0019-9958(72)90424-x · Cited by 176
Constructing Programs from Example Computations
Biermann, A. W., & Krishnaswamy, R. (1976) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1976.233812 · Cited by 167
Syntactic Pattern Recognition, Applications
(1977) · Communication and Cybernetics · doi:10.1007/978-3-642-66438-0 · Cited by 166
Blum, M. (1967) · Information and Control · doi:10.1016/s0019-9958(67)90546-3 · Cited by 138
An interference matching technique for inducing abstractions
Hayes-Roth, F. A., & McDermott, J. P. (1978) · Communications of the ACM · doi:10.1145/359488.359503 · Cited by 119
The Inference of Regular LISP Programs from Examples
Biermann, A. W. (1978) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/tsmc.1978.4310035 · Cited by 118
Learning and Inductive Inference
(1982) · Elsevier eBooks · doi:10.1016/b978-0-86576-091-2.50009-5 · Cited by 112
Shapiro, E. Y. (1982) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/582153.582185 · Cited by 108
Research in the theory of inductive inference by GDR mathematicians—A survey
Klette, R., & Wiehagen, R. (1980) · Information Sciences · doi:10.1016/s0020-0255(80)80006-5 · Cited by 98
A SURVEY OF RESULTS IN GRAMMATICAL INFERENCE
Biermann, A. W., & Feldman, J. A. (1972) · Elsevier eBooks · doi:10.1016/b978-0-12-737140-5.50007-5 · Cited by 95
On the inference of Turing machines from sample computations
Biermann, A. W. (1972) · Artificial Intelligence · doi:10.1016/0004-3702(72)90048-3 · Cited by 95
Kugel, P. (1977) · Information and Control · doi:10.1016/s0019-9958(77)90175-9 · Cited by 88
Information-theoretic characterizations of recursive infinite strings
Chaitin, G. J. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90005-0 · Cited by 87
Frontiers of Pattern Recognition
Thompson, M., & Watanabe, S. (1975) · Leonardo · doi:10.2307/1573270 · Cited by 82
Proceedings of the 4th international joint conference on Artificial Intelligence
Bundy, A. (1975) · Cited by 72
GRAMMATICAL COMPLEXITY AND INFERENCE
Feldman, J. A., Gips, J., Horning, J. J., & Reder, S. (1969) · Defense Technical Information Center (DTIC) · doi:10.21236/ad0692390 · Cited by 71
Behaviour/structure transformations under uncertainty
Gaines, B. R. (1976) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(76)80005-3 · Cited by 70
Information-Theoretical Aspects of Inductive and Deductive Inference
Watanabé, S. (1960) · IBM Journal of Research and Development · doi:10.1147/rd.42.0208 · Cited by 66
Approximate language identification
Wharton, R. M. (1974) · Information and Control · doi:10.1016/s0019-9958(74)91369-2 · Cited by 64
On the relation between descriptional complexity and algorithmic probability
Gács, P. (1983) · Theoretical Computer Science · doi:10.1016/0304-3975(83)90139-1 · Cited by 63
Harré, R. (1970) · Palgrave Macmillan UK eBooks · doi:10.1007/978-1-349-81592-0_6 · Cited by 56
Speeding up the Synthesis of Programs from Traces
Biermann, A. W., Baum, R. I., & Petry, F. E. (1975) · IEEE Transactions on Computers · doi:10.1109/t-c.1975.224180 · Cited by 45
Grammar enumeration and inference
Wharton, R. M. (1977) · Information and Control · doi:10.1016/s0019-9958(77)80005-3 · Cited by 27
On the inference of stochastic regular grammars
Mude, A. V. D., & Walker, A. (1978) · Information and Control · doi:10.1016/s0019-9958(78)90106-7 · Cited by 26
Feliciangeli, H., & Herman, G. T. (1973) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(73)80051-0 · Cited by 25
Program construction from examples.
Summers, P. D. (1975) · Cited by 21
Automatic program synthesis from example problems
Siklóssy, L., & Sykes, D. A. (1975) · International Joint Conference on Artificial Intelligence · Cited by 21
On the inference of optimal descriptions
Daley, R. (1977) · Theoretical Computer Science · doi:10.1016/0304-3975(77)90015-9 · Cited by 21
Solomonoff, R. J. (1975) · Cited by 18
An Example of Information and Computation Resource Trade-Off
Daley, R. (1973) · Journal of the ACM · doi:10.1145/321784.321794 · Cited by 12
Inference for regular bilanguages
Berger, J., & Pair, C. (1978) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(78)90052-1 · Cited by 8
Construction of Natural Language Sentence Acceptors by a Supervised-Learning Technique
Coulon, D., & Kayser, D. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.4766882 · Cited by 3
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
Workflow 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-citation
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.