{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T06:54:51Z","timestamp":1777618491843,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,6,3]],"date-time":"2011-06-03T00:00:00Z","timestamp":1307059200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s10994-011-5248-5","type":"journal-article","created":{"date-parts":[[2011,6,3]],"date-time":"2011-06-03T03:16:26Z","timestamp":1307070986000},"page":"273-297","source":"Crossref","is-referenced-by-count":15,"title":["Construction and learnability of canonical Horn formulas"],"prefix":"10.1007","volume":"85","author":[{"given":"Marta","family":"Arias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 L.","family":"Balc\u00e1zar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,3]]},"reference":[{"issue":"2","key":"5248_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D. (1987). Learning regular sets from queries and counterexamples. Information and Computation, 75(2), 87\u2013106.","journal-title":"Information and Computation"},{"issue":"2","key":"5248_CR2","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1006\/jcss.1995.1026","volume":"50","author":"D. Angluin","year":"1995","unstructured":"Angluin, D., & Kharitonov, M. (1995). When won\u2019t membership queries help? Journal of Computer and System Sciences, 50(2), 336\u2013355.","journal-title":"Journal of Computer and System Sciences"},{"key":"5248_CR3","first-page":"147","volume":"9","author":"D. Angluin","year":"1992","unstructured":"Angluin, D., Frazier, M., & Pitt, L. (1992). Learning conjunctions of Horn clauses. Machine Learning, 9, 147\u2013164.","journal-title":"Machine Learning"},{"key":"5248_CR4","series-title":"LNAI","first-page":"303","volume-title":"ALT 2008","author":"M. Arias","year":"2008","unstructured":"Arias, M., & Balc\u00e1zar, J. L. (2008). Query learning and certificates in lattices. In LNAI: Vol.\u00a05254. ALT 2008 (pp. 303\u2013315)."},{"key":"5248_CR5","series-title":"LNAI","first-page":"156","volume-title":"ALT 2009","author":"M. Arias","year":"2009","unstructured":"Arias, M., & Balc\u00e1zar, J. L. (2009). Canonical Horn representations and query learning. In LNAI: Vol.\u00a05809. ALT 2009 (pp. 156\u2013170)."},{"issue":"1","key":"5248_CR6","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/S0890-5401(02)93162-7","volume":"178","author":"M. Arias","year":"2002","unstructured":"Arias, M., & Khardon, R. (2002). Learning closed Horn expressions. Information and Computation, 178(1), 214\u2013240.","journal-title":"Information and Computation"},{"issue":"5","key":"5248_CR7","doi-asserted-by":"crossref","first-page":"816","DOI":"10.1016\/j.ic.2006.03.001","volume":"204","author":"M. Arias","year":"2006","unstructured":"Arias, M., Feigelson, A., Khardon, R., & Servedio, R. A. (2006). Polynomial certificates for propositional classes. Information and Computation, 204(5), 816\u2013834.","journal-title":"Information and Computation"},{"key":"5248_CR8","first-page":"587","volume":"8","author":"M. Arias","year":"2007","unstructured":"Arias, M., Khardon, R., & Maloberti, J. (2007). Learning Horn expressions with LogAn-H. Journal of Machine Learning Research, 8, 587.","journal-title":"Journal of Machine Learning Research"},{"key":"5248_CR9","volume-title":"Computability in Europe conference","author":"J. L. Balc\u00e1zar","year":"2005","unstructured":"Balc\u00e1zar, J. L. (2005). Query learning of Horn formulas revisited. In Computability in Europe conference."},{"issue":"22\u201324","key":"5248_CR10","doi-asserted-by":"crossref","first-page":"2155","DOI":"10.1016\/j.tcs.2009.12.021","volume":"411","author":"K. Bertet","year":"2010","unstructured":"Bertet, K., & Monjardet, B. (2010). The multiple facets of the canonical direct unit implicational basis. Theoretical Computer Science, 411(22\u201324), 2155\u20132166.","journal-title":"Theoretical Computer Science"},{"key":"5248_CR11","volume-title":"Symbolic logic and mechanical theorem proving","author":"C. L. Chang","year":"1973","unstructured":"Chang, C. L., & Lee, R. (1973). Symbolic logic and mechanical theorem proving. Orlando: Academic Press."},{"key":"5248_CR12","first-page":"120","volume-title":"Proceedings of the international conference on machine learning","author":"M. Frazier","year":"1993","unstructured":"Frazier, M., & Pitt, L. (1993). Learning from entailment: an application to propositional Horn sentences. In Proceedings of the international conference on machine learning (pp. 120\u2013127), Amherst, MA. San\u00a0Mateo: Morgan Kaufmann."},{"key":"5248_CR13","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/A:1026443024002","volume":"25","author":"M. Frazier","year":"1996","unstructured":"Frazier, M., & Pitt, L. (1996). CLASSIC learning. Machine Learning, 25, 151\u2013193.","journal-title":"Machine Learning"},{"key":"5248_CR14","volume-title":"Computability in Europe conference","author":"J. Gaintzarain","year":"2005","unstructured":"Gaintzarain, J., Hermo, M., & Navarro, M. (2005). On learning conjunctions of Horn\u2283 clauses. In Computability in Europe conference."},{"key":"5248_CR15","first-page":"5","volume":"95","author":"J. L. Guigues","year":"1986","unstructured":"Guigues, J. L., & Duquenne, V. (1986). Familles minimales d\u2019implications informatives resultants d\u2019un tableau de donn\u00e9es binaires. Math\u00e9matiques Et Sciences Humaines, 95, 5\u201318.","journal-title":"Math\u00e9matiques Et Sciences Humaines"},{"issue":"5","key":"5248_CR16","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1145\/234752.234755","volume":"43","author":"L. Hellerstein","year":"1996","unstructured":"Hellerstein, L., Pillaipakkamnatt, K., Raghavan, V., & Wilkins, D. (1996). How many queries are needed to learn? Journal of the ACM, 43(5), 840\u2013862.","journal-title":"Journal of the ACM"},{"key":"5248_CR17","volume-title":"International symposium on artificial intelligence and mathematics","author":"M. Hermo","year":"2002","unstructured":"Hermo, M., & Lav\u00edn, V. (2002). Negative results on learning dependencies with queries. In International symposium on artificial intelligence and mathematics."},{"key":"5248_CR18","doi-asserted-by":"crossref","first-page":"14","DOI":"10.2307\/2268661","volume":"16","author":"A. Horn","year":"1956","unstructured":"Horn, A. (1956). On sentences which are true of direct unions of algebras. The Journal of Symbolic Logic, 16, 14\u201321.","journal-title":"The Journal of Symbolic Logic"},{"issue":"1\u20132","key":"5248_CR19","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0004-3702(96)00006-9","volume":"87","author":"R. Khardon","year":"1996","unstructured":"Khardon, R., & Roth, D. (1996). Reasoning with models. Artificial Intelligence, 87(1\u20132), 187\u2013213.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"5248_CR20","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. (1995). Approximate inference of functional dependencies from relations. Theoretical Computer Science, 149(1), 129\u2013149.","journal-title":"Theoretical Computer Science"},{"key":"5248_CR21","volume-title":"Propositional logic: deduction and algorithms","author":"H. Kleine B\u00fcning","year":"1999","unstructured":"Kleine B\u00fcning, H., & Lettmann, T. (1999). Propositional logic: deduction and algorithms. Cambridge: Cambridge University Press."},{"key":"5248_CR22","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1145\/322217.322223","volume":"27","author":"D. Maier","year":"1980","unstructured":"Maier, D. (1980). Minimum covers in relational database model. Journal of the ACM, 27, 664\u2013674.","journal-title":"Journal of the ACM"},{"key":"5248_CR23","doi-asserted-by":"crossref","first-page":"61","DOI":"10.2307\/2268172","volume":"8","author":"J. C. C. McKinsey","year":"1943","unstructured":"McKinsey, J. C. C. (1943). The decision problem for some classes of sentences without quantifiers. The Journal of Symbolic Logic, 8, 61\u201376.","journal-title":"The Journal of Symbolic Logic"},{"issue":"1","key":"5248_CR24","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1023\/A:1022678217288","volume":"14","author":"C. Rouveirol","year":"1994","unstructured":"Rouveirol, C. (1994). Flattening and saturation: two representation changes for generalization. Machine Learning, 14(1), 219\u2013232.","journal-title":"Machine Learning"},{"issue":"2","key":"5248_CR25","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1145\/226643.226644","volume":"43","author":"B. Selman","year":"1996","unstructured":"Selman, B., & Kautz, H. (1996). Knowledge compilation and theory approximation. Journal of the ACM, 43(2), 193\u2013224.","journal-title":"Journal of the ACM"},{"issue":"11","key":"5248_CR26","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM, 27(11), 1134\u20131142.","journal-title":"Communications of the ACM"},{"key":"5248_CR27","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1147\/rd.41.0002","volume":"4","author":"H. Wang","year":"1960","unstructured":"Wang, H. (1960). Toward mechanical mathematics. IBM Journal for Research and Development, 4, 2\u201322.","journal-title":"IBM Journal for Research and Development"},{"key":"5248_CR28","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1006\/aima.1994.1069","volume":"108","author":"M. Wild","year":"1994","unstructured":"Wild, M. (1994). A theory of finite closure spaces based on implications. Advances in Mathematics, 108, 118\u2013139.","journal-title":"Advances in Mathematics"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-011-5248-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-011-5248-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-011-5248-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:40:31Z","timestamp":1559338831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-011-5248-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,3]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["5248"],"URL":"https:\/\/doi.org\/10.1007\/s10994-011-5248-5","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,3]]}}}