{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T16:17:54Z","timestamp":1783095474634,"version":"3.54.6"},"reference-count":31,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"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":6529,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1016\/0304-3975(95)00028-u","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:48:18Z","timestamp":1027630098000},"page":"129-149","source":"Crossref","is-referenced-by-count":168,"title":["Approximate inference of functional dependencies from relations"],"prefix":"10.1016","volume":"149","author":[{"given":"Jyrki","family":"Kivinen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heikki","family":"Mannila","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00028-U_BIB1","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0004-3702(94)90084-1","article-title":"Learning Boolean concepts in the presence of many irrelevant features","volume":"69","author":"Almuallim","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(95)00028-U_BIB2","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/BF00116828","article-title":"Queries and concept learning","volume":"2","author":"Angluin","year":"1988","journal-title":"Mach. Learning"},{"key":"10.1016\/0304-3975(95)00028-U_BIB3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF00992675","article-title":"Learning conjunctions of Horn clauses","volume":"9","author":"Angluin","year":"1992","journal-title":"Mach. Learning"},{"key":"10.1016\/0304-3975(95)00028-U_BIB4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","article-title":"Fast probabilistic algorithms for Hamiltonian circuits and matching","volume":"18","author":"Angluin","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00028-U_BIB5","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/2422.322414","article-title":"On the structure of Armstrong relations for functional dependencies","volume":"31","author":"Beeri","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(95)00028-U_BIB6","series-title":"Proc. 11th Internat. Conf. on Very Large Data Bases","first-page":"82","article-title":"Database design tools: an expert system approach","author":"Bouzeghoub","year":"1985"},{"key":"10.1016\/0304-3975(95)00028-U_BIB7","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1147\/rd.281.0082","article-title":"Mapping uninterpreted schemes into entity-relationship diagrams: two applications to conceptual schema design","volume":"28","author":"Casanova","year":"1984","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0304-3975(95)00028-U_BIB8","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0022-0000(90)90031-F","article-title":"Decomposing a relation into a tree of binary relations","volume":"41","author":"Dechter","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00028-U_BIB9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0004-3702(92)90009-M","volume":"58","author":"Dechter","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(95)00028-U_BIB10","first-page":"35","article-title":"Keys, antikeys and prime attributes","volume":"8","author":"Demetrovics","year":"1987","journal-title":"Ann. Univ. Sci. Budapest Sect. Comput."},{"key":"10.1016\/0304-3975(95)00028-U_BIB11","first-page":"273","article-title":"Some results about functional dependencies","volume":"8","author":"Demetrovics","year":"1988","journal-title":"Acta Cybernet."},{"key":"10.1016\/0304-3975(95)00028-U_BIB12","doi-asserted-by":"crossref","DOI":"10.1137\/S0097539793250299","article-title":"Identifying the minimal transversals of a hypergraph and related problems","author":"Eiter","year":"1991"},{"key":"10.1016\/0304-3975(95)00028-U_BIB13","doi-asserted-by":"crossref","unstructured":"H.A. Kautz, M.J. Kearns and B. Selman, Horn approximations of empirical data, Artificial Intelligence to appear.","DOI":"10.1016\/0004-3702(94)00072-9"},{"key":"10.1016\/0304-3975(95)00028-U_BIB14","series-title":"Proc. 13th Symp. on Principles of Database Systems","first-page":"77","article-title":"The power of sampling in knowledge discovery","author":"Kivinen","year":"1994"},{"key":"10.1016\/0304-3975(95)00028-U_BIB15","series-title":"Proc. Internat. Conf. on Management of Data","first-page":"1","article-title":"Practical selectivity estimation through adaptive sampling","author":"Lipton","year":"1990"},{"key":"10.1016\/0304-3975(95)00028-U_BIB16","series-title":"The Theory of Relational Databases","author":"Maier","year":"1983"},{"key":"10.1016\/0304-3975(95)00028-U_BIB17","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/0022-0000(86)90015-2","article-title":"Design by example: an application of Armstrong relations","volume":"33","author":"Mannila","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00028-U_BIB18","series-title":"Proc. 13th Internat. Conf. on Very Large Data Bases","first-page":"155","article-title":"Dependency inference","author":"Mannila","year":"1987"},{"key":"10.1016\/0304-3975(95)00028-U_BIB19","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0166-218X(92)90031-5","article-title":"On the complexity of inferring functional dependencies","volume":"40","author":"Mannila","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0304-3975(95)00028-U_BIB20","series-title":"Design of Relational Databases","author":"Mannila","year":"1992"},{"key":"10.1016\/0304-3975(95)00028-U_BIB21","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0169-023X(94)90023-X","article-title":"Algorithms for inferring functional dependencies","volume":"12","author":"Mannila","year":"1994","journal-title":"Data Knowl. Eng."},{"key":"10.1016\/0304-3975(95)00028-U_BIB22","series-title":"Truthlikeness","author":"Niiniluoto","year":"1987"},{"key":"10.1016\/0304-3975(95)00028-U_BIB23","series-title":"Proc. Machine Discovery Workshop","article-title":"Probabilistic data dependencies","author":"Piatetsky-Shapiro","year":"1992"},{"key":"10.1016\/0304-3975(95)00028-U_BIB24","series-title":"Knowledge Discovery in Database","year":"1991"},{"key":"10.1016\/0304-3975(95)00028-U_BIB25","series-title":"The Use of Knowledge in Analogy and Induction","author":"Russell","year":"1989"},{"key":"10.1016\/0304-3975(95)00028-U_BIB26","series-title":"Proc. AAAI Workshop on Knowledge Discovery in Databases","first-page":"64","article-title":"Learning determinations and checking databases","author":"Schlimmer","year":"1991"},{"key":"10.1016\/0304-3975(95)00028-U_BIB27","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/322261.322263","article-title":"An equivalence between relational database dependencies and a fragment of propositional logic","volume":"28","author":"Sagiv","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(95)00028-U_BIB28","article-title":"Automatic rule derivation for semantic query optimization","author":"Siegel","year":"1986"},{"key":"10.1016\/0304-3975(95)00028-U_BIB29","series-title":"Advances in Data Base Theory","first-page":"115","article-title":"A method for helping discover the dependencies of a relation","author":"Silva","year":"1981"},{"key":"10.1016\/0304-3975(95)00028-U_BIB30","volume":"Volume I","author":"Ullman","year":"1988"},{"key":"10.1016\/0304-3975(95)00028-U_BIB31","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Comm. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500028U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500028U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:50:32Z","timestamp":1555404632000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759500028U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["030439759500028U"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00028-u","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}