{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:43:35Z","timestamp":1740109415235,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,9,30]],"date-time":"2015-09-30T00:00:00Z","timestamp":1443571200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s00224-015-9659-8","type":"journal-article","created":{"date-parts":[[2015,9,30]],"date-time":"2015-09-30T02:58:16Z","timestamp":1443581896000},"page":"500-516","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning Sets of Antecedent-restricted Functional and Multivalued Dependencies with Queries"],"prefix":"10.1007","volume":"59","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9420-5223","authenticated-orcid":false,"given":"V\u00edctor","family":"Lav\u00edn Puente","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,30]]},"reference":[{"key":"9659_CR1","unstructured":"Angluin, D.: Learning k-term DNF Using Queries and Counterexamples. TR-YALEU\/DCS\/RR-559 (1987)"},{"issue":"4","key":"9659_CR2","first-page":"319","volume":"2","author":"D Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Mach. Learn. 2(4), 319\u2013342 (1988)","journal-title":"Mach. Learn."},{"key":"9659_CR3","first-page":"121","volume":"5","author":"D Angluin","year":"1990","unstructured":"Angluin, D.: Negative results for equivalence queries. Mach. Learn. 5, 121\u2013150 (1990)","journal-title":"Mach. Learn."},{"key":"9659_CR4","first-page":"147","volume":"9","author":"D Angluin","year":"1992","unstructured":"Angluin, D., Frazier, M., Pitt, L.: Learning conjunctions of horn clauses. Mach. Learn. 9, 147\u2013164 (1992)","journal-title":"Mach. Learn."},{"key":"9659_CR5","doi-asserted-by":"crossref","unstructured":"Balc\u00e1zar, J.L., Baixeries, J.: Characterizations of multivalued dependencies and related expressions. In: Proceedings DS 2004, LNAI, vol. 3245, pp 306\u2013313. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-30214-8_25"},{"issue":"4","key":"9659_CR6","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/320493.320489","volume":"1","author":"PA Bernstein","year":"1976","unstructured":"Bernstein, P.A.: Synthesizing third normal form relations from functional dependencies. ACM Trans. Database Syst. 1(4), 277\u2013298 (1976)","journal-title":"ACM Trans. Database Syst."},{"issue":"6","key":"9659_CR7","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","volume":"13","author":"EF Codd","year":"1970","unstructured":"Codd, E.F.: A relational model for large shared data banks. Comm. ACM 13(6), 377\u2013387 (1970)","journal-title":"Comm. ACM"},{"issue":"3","key":"9659_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/320263.320271","volume":"3","author":"C Delobel","year":"1978","unstructured":"Delobel, C.: Normalization and hierarchical dependencies in the relational model. ACM Trans. Database Syst. 3(3), 201\u2013222 (1978)","journal-title":"ACM Trans. Database Syst."},{"key":"9659_CR9","volume-title":"Fundamentals of Database Systems","author":"R Elmasri","year":"1994","unstructured":"Elmasri, R., Navathe, S.B.: Fundamentals of Database Systems. Benjamin-Cummings Pub, Redwood City, California (1994)"},{"issue":"3","key":"9659_CR10","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/320557.320571","volume":"2","author":"R Fagin","year":"1977","unstructured":"Fagin, R.: Multivalued dependencies and a new normal form for relational databases. ACM Trans. Database Syst. 2(3), 262\u2013278 (1977)","journal-title":"ACM Trans. Database Syst."},{"key":"9659_CR11","doi-asserted-by":"crossref","unstructured":"Hermo, M., Lav\u00edn, V.: Learning minimal covers of functional dependencies with queries. In: Proceedings ALT 1999, LNCS, vol. 1720, pp 291\u2013300. Springer, Berlin (1999)","DOI":"10.1007\/3-540-46769-6_24"},{"key":"9659_CR12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s002360050161","volume":"36","author":"R Khardon","year":"1999","unstructured":"Khardon, R., Mannila, H., Roth, D.: Reasoning with examples: propositional formulae and database dependencies. Acta Inf. 36, 267\u2013286 (1999)","journal-title":"Acta Inf."},{"key":"9659_CR13","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(95)00028-U","volume":"149","author":"J Kivinen","year":"1995","unstructured":"Kivinen, J., Mannila, H.: Approximate inference of functional dependencies from relations. Theor. Comput. Sci. 149, 129\u2013149 (1995)","journal-title":"Theor. Comput. Sci."},{"issue":"22","key":"9659_CR14","doi-asserted-by":"crossref","first-page":"2331","DOI":"10.1016\/j.tcs.2011.01.011","volume":"412","author":"V Lav\u00edn Puente","year":"2011","unstructured":"Lav\u00edn Puente, V.: On learning multivalued dependencies with queries. Theor. Comput. Sci. 412(22), 2331\u20132339 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"11","key":"9659_CR15","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1016\/j.ipl.2011.03.008","volume":"111","author":"V Lav\u00edn Puente","year":"2011","unstructured":"Lav\u00edn Puente, V.: Learning a subclass of k-quasi-horn formulas with membership queries. Inf. Process. Lett. 111(11), 550\u2013555 (2011)","journal-title":"Inf. Process. Lett."},{"issue":"19","key":"9659_CR16","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1016\/j.ipl.2011.07.007","volume":"111","author":"V Lav\u00edn Puente","year":"2011","unstructured":"Lav\u00edn Puente, V., Hermo, M.: Negative results on learning multivalued dependencies with queries. Inf. Process. Lett. 111(19), 968\u2013972 (2011)","journal-title":"Inf. Process. Lett."},{"key":"9659_CR17","doi-asserted-by":"crossref","unstructured":"Lav\u00edn Puente, V.: Learning an extension of the class of functional dependencies with queries. N. Gener. Comput. 33(3), 319\u2013340 (2015)","DOI":"10.1007\/s00354-015-0301-8"},{"issue":"1","key":"9659_CR18","first-page":"69","volume":"17","author":"S Mahadevan","year":"1994","unstructured":"Mahadevan, S., Tadepalli, P.: Quantifying prior determination knowledge using pac learning model. Mach. Learn. 17(1), 69\u2013105 (1994)","journal-title":"Mach. Learn."},{"key":"9659_CR19","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1006\/inco.1995.1149","volume":"122","author":"K Pillaipakkamnatt","year":"1995","unstructured":"Pillaipakkamnatt, K., Raghavan, V.: Read twice DNF formulas are properly learnable. Inf. Comput. 122, 236\u2013267 (1995)","journal-title":"Inf. Comput."},{"issue":"3","key":"9659_CR20","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/322261.322263","volume":"28","author":"Y Sagiv","year":"1981","unstructured":"Sagiv, Y., Delobel, C., Stott Parker, D., Fagin, R.: An equivalence between relational database dependencies and a fragment of propositional logic. J. Assoc. Comput. Mach. 28(3), 435\u2013453 (1981)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9659_CR21","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/A:1007421315813","volume":"32","author":"P Tadepalli","year":"1998","unstructured":"Tadepalli, P., Russel, S.: Learning from examples and membership queries with structured determinations. Mach. Learn. 32, 245\u2013295 (1998)","journal-title":"Mach. Learn."},{"issue":"3","key":"9659_CR22","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/990511.990513","volume":"14","author":"DM Tsou","year":"1982","unstructured":"Tsou, D.M., Fisher, P.C.: Decomposition of a relation scheme into Boyce-Codd normal form. SIGACT News 14(3), 23\u201329 (1982)","journal-title":"SIGACT News"},{"key":"9659_CR23","unstructured":"Ullman, J.D.: Principles of Database and Knowledge-Base Systems. Computer Science Press Inc (1988)"},{"key":"9659_CR24","unstructured":"Zaniolo, D.C.: Analysis and design of relational schemata for database systems. Doctoral Dissertation UCLA (1976)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9659-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-015-9659-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9659-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:54:28Z","timestamp":1558684468000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-015-9659-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,30]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["9659"],"URL":"https:\/\/doi.org\/10.1007\/s00224-015-9659-8","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2015,9,30]]}}}