{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:06:24Z","timestamp":1725876384889},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319514680"},{"type":"electronic","value":"9783319514697"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-51469-7_22","type":"book-chapter","created":{"date-parts":[[2016,12,24]],"date-time":"2016-12-24T21:23:01Z","timestamp":1482614581000},"page":"257-268","source":"Crossref","is-referenced-by-count":2,"title":["The Learnability of Business Rules"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Wang","sequence":"first","affiliation":[]},{"given":"Changhai","family":"Ke","sequence":"additional","affiliation":[]},{"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[]},{"given":"Christian","family":"de Sainte\u00a0Marie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,25]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1214\/ss\/1177011444","volume":"7","author":"LM Berliner","year":"1992","unstructured":"Berliner, L.M.: Statistics, probability and chaos. Stat. Sci. 7, 69\u201390 (1992)","journal-title":"Stat. Sci."},{"issue":"1","key":"22_CR2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0004-3702(98)00034-4","volume":"101","author":"H Blockeel","year":"1998","unstructured":"Blockeel, H., De Raedt, L.: Top-down induction of first-order logical decision trees. Artif. Intell. 101(1), 285\u2013297 (1998)","journal-title":"Artif. Intell."},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-662-46497-7_3","volume-title":"Theory of Cryptography","author":"A Cohen","year":"2015","unstructured":"Cohen, A., Goldwasser, S., Vaikuntanathan, V.: Aggregate pseudorandom functions and connections to learning. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 61\u201389. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-46497-7_3"},{"key":"22_CR4","unstructured":"de Sainte Marie, C., Hallmark, G., Paschke, A.: RIF Production Rule Dialect, 2nd edn. W3C Recommendation (2013)"},{"issue":"33","key":"22_CR5","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1145\/6490.6503","volume":"4","author":"O Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 4(33), 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"22_CR6","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Boston (1979)"},{"key":"22_CR7","unstructured":"IBM. Operational Decision Manager 8.8 (2015)"},{"key":"22_CR8","unstructured":"Kepser, S.: A simple proof of the turing-completeness of XSLT and XQuery. In: Usdin, T. (ed.) Extreme Markup Languages 2004 (2004)"},{"key":"22_CR9","volume-title":"Introduction to Metamathematics","author":"SC Kleene","year":"1952","unstructured":"Kleene, S.C.: Introduction to Metamathematics. North-Holland Publishing Co., Amsterdam (1952)"},{"issue":"1","key":"22_CR10","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/s10878-014-9715-3","volume":"28","author":"L Liberti","year":"2014","unstructured":"Liberti, L., Marinelli, F.: Mathematical programming: turing completeness and applications to software analysis. J. Comb. Optim. 28(1), 82\u2013104 (2014)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"22_CR11","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0004-3702(94)90112-0","volume":"104","author":"L Raedt De","year":"1994","unstructured":"De Raedt, L., D\u017eeroski, S.: First-order jk-clausal theories are PAC-learnable. Artif. Intell. 104(1), 375\u2013392 (1994)","journal-title":"Artif. Intell."},{"key":"22_CR12","series-title":"Annals of Mathematics Studies","first-page":"157","volume-title":"Automata Studies","author":"C Shannon","year":"1956","unstructured":"Shannon, C.: A Universal Turing machine with two internal states. In: Shannon, C., McCarthy, J. (eds.) Automata Studies. Annals of Mathematics Studies, vol. 34, pp. 157\u2013165. Princeton University Press, Princeton (1956)"},{"issue":"1","key":"22_CR13","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","volume":"42","author":"A Turing","year":"1937","unstructured":"Turing, A.: On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. 42(1), 230\u2013265 (1937)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"27","key":"22_CR14","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"11","author":"LG Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Commun. ACM 11(27), 1134\u20131142 (1984)","journal-title":"Commun. ACM"},{"key":"22_CR15","unstructured":"Wang, O., Kai, C., Liberti, L., De Sainte Marie, C.: Business rule sets as programs: turing-completeness and structural operational semantics. In: Treizi\u00e8mes Rencontres des Jeunes Chercheurs en Intelligence Artificielle (RJCIA 2015) (2015)"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-42019-6_6","volume-title":"Rule Technologies. Research, Tools, and Applications","author":"O Wang","year":"2016","unstructured":"Wang, O., Liberti, L., D\u2019Ambrosio, C., Sainte Marie, C., Ke, C.: Controlling the average behavior of business rules programs. In: Alferes, J.J.J., Bertossi, L., Governatori, G., Fodor, P., Roman, D. (eds.) RuleML 2016. LNCS, vol. 9718, pp. 83\u201396. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-42019-6_6"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Big Data"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51469-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T06:43:00Z","timestamp":1498372980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51469-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319514680","9783319514697"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51469-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}