{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T15:12:53Z","timestamp":1774365173596,"version":"3.50.1"},"reference-count":26,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6591,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1016\/0166-218x(94)00007-z","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:02:29Z","timestamp":1027634549000},"page":"1-25","source":"Crossref","is-referenced-by-count":31,"title":["On specifying Boolean functions by labelled examples"],"prefix":"10.1016","volume":"61","author":[{"given":"Martin","family":"Anthony","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Graham","family":"Brightwell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Shawe-Taylor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)00007-Z_BIB1","series-title":"Combinatorics of Finite Sets","author":"Anderson","year":"1987"},{"key":"10.1016\/0166-218X(94)00007-Z_BIB2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00116828","article-title":"Queries and concept learning","volume":"2","author":"Angluin","year":"1988","journal-title":"Mach. Learning"},{"key":"10.1016\/0166-218X(94)00007-Z_BIB3","series-title":"Computational Learning Theory: An Introduction","author":"Anthony","year":"1992"},{"key":"10.1016\/0166-218X(94)00007-Z_BIB4","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1017\/S0963548300000778","article-title":"Using the perceptron algorithm to find consistent hypotheses","volume":"2","author":"Anthony","year":"1993","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/0166-218X(94)00007-Z_BIB5","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","article-title":"Learnability and the Vapnik-Chervonen-kis dimension","volume":"36","author":"Blumer","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(94)00007-Z_BIB6","series-title":"Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability","author":"Bollob\u00e1s","year":"1986"},{"key":"10.1016\/0166-218X(94)00007-Z_BIB7","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54945-5_54","article-title":"Identifying 2-monotonic positive Boolean functions in polynomial time","author":"Boros","year":"1991"},{"key":"10.1016\/0166-218X(94)00007-Z_BIB8","series-title":"Proceedings of the 1988 Workshop on Computational Learning Theory","article-title":"Inductive inference \u2014 an abstract approach","author":"Cherniavsky","year":"1988"},{"key":"10.1016\/0166-218X(94)00007-Z_BIB9","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/PGEC.1965.264137","article-title":"Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition","volume":"14","author":"Cover","year":"1965","journal-title":"IEEE Trans. Electron. Comput."},{"key":"10.1016\/0166-218X(94)00007-Z_BIB10","series-title":"Computers and Intractibility: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(94)00007-Z_BIB11","series-title":"COLT'91, Proceedings of the Fourth Annual Workshop on Computational Learning Theory","article-title":"On the complexity of teaching","author":"Goldman","year":"1991"},{"key":"10.1016\/0166-218X(94)00007-Z_BIB12","series-title":"Proceedings of the Thirty-first Annual Symposium on Foundations of Computer Science","article-title":"Exact identification of circuits using fixed points of amplification functions","author":"Goldman","year":"1990"},{"key":"10.1016\/0166-218X(94)00007-Z_BIB13","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF00336991","article-title":"Linear function neurons: structure and training","volume":"53","author":"Hampson","year":"1986","journal-title":"Biol. Cybernet."},{"key":"10.1016\/0166-218X(94)00007-Z_BIB14","series-title":"Threshold Logic","author":"Hu","year":"1965"},{"key":"10.1016\/0166-218X(94)00007-Z_BIB15","series-title":"Proceedings of the Fifth Annual Workshop on Computational Learning Theory","article-title":"A computational model of teaching","author":"Jackson","year":"1992"},{"key":"10.1016\/0166-218X(94)00007-Z_BIB16","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0166-218X(94)00007-Z_BIB17","series-title":"Complexity of Computer Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0166-218X(94)00007-Z_BIB18","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF00116827","article-title":"Learning quickly when irrelevant attributes abound: a new linear threshold learning algorithm","volume":"2","author":"Littlestone","year":"1988","journal-title":"Mach. Learning"},{"key":"10.1016\/0166-218X(94)00007-Z_BIB19","article-title":"Adaptive threshold logic","author":"fl Mays","year":"1963"},{"key":"10.1016\/0166-218X(94)00007-Z_BIB20","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF00058680","article-title":"Learning decision lists","volume":"2","author":"Rivest","year":"1987","journal-title":"Mach. Learning"},{"key":"10.1016\/0166-218X(94)00007-Z_BIB21","series-title":"Proceedings of the Fifth Annual Workshop on Computational Learning Theory","article-title":"Approximate testing and learnability","author":"Romanik","year":"1992"},{"key":"10.1016\/0166-218X(94)00007-Z_BIB22","article-title":"Testing geometric objects","author":"Romanik","year":"1990"},{"key":"10.1016\/0166-218X(94)00007-Z_BIB23","article-title":"Learning with a helpful teacher","author":"Salzberg","year":"1990"},{"key":"10.1016\/0166-218X(94)00007-Z_BIB24","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF03037091","article-title":"Teachability in computational learning","volume":"8","author":"Shinohara","year":"1991","journal-title":"New Generation Comput."},{"key":"10.1016\/0166-218X(94)00007-Z_BIB25","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/BF01171114","article-title":"Ein Satz \u00fcber Untermengen einer endlichen Menge","volume":"27","author":"Sperner","year":"1928","journal-title":"Math. Z."},{"key":"10.1016\/0166-218X(94)00007-Z_BIB26","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","article-title":"On the uniform convergence of relative frequencies of events to their probabilities","volume":"16","author":"Vapnik","year":"1971","journal-title":"Theory Probab. Appl."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9400007Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9400007Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T23:55:28Z","timestamp":1555286128000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9400007Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["0166218X9400007Z"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)00007-z","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}