乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:46:25Z","timestamp":1725893185994},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,3,12]],"date-time":"2015-03-12T00:00:00Z","timestamp":1426118400000},"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":["Mach Learn"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10994-014-5471-y","type":"journal-article","created":{"date-parts":[[2015,3,11]],"date-time":"2015-03-11T15:31:25Z","timestamp":1426087885000},"page":"49-73","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":86,"title":["Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited"],"prefix":"10.1007","volume":"100","author":[{"given":"Stephen H.","family":"Muggleton","sequence":"first","affiliation":[]},{"given":"Dianhuan","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Alireza","family":"Tamaddoni-Nezhad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,12]]},"reference":[{"issue":"4","key":"5471_CR1","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A Blumer","year":"1989","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989). Learnability and the Vapnik\u2013Chervonenkis dimension. Journal of the ACM, 36(4), 929\u2013965.","journal-title":"Journal of the ACM"},{"key":"5471_CR2","doi-asserted-by":"crossref","unstructured":"Carlson, A., Betteridge, J., Kisiel, B., Settles, B., Hruschka Jr., E. R., & Mitchell, T. M. (2010). Toward an architecture for never-ending language learning. In Proceedings of the twenty-fourth conference on artificial intelligence (AAAI 2010).","DOI":"10.1609\/aaai.v24i1.7519"},{"key":"5471_CR3","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0004-3702(94)90070-1","volume":"68","author":"W Cohen","year":"1994","unstructured":"Cohen, W. (1994). Grammatically biased learning: Learning logic programs using an explicit antecedent description language. Artificial Intelligence, 68, 303\u2013366.","journal-title":"Artificial Intelligence"},{"key":"5471_CR4","unstructured":"Cropper, A., & Muggleton, S. H. (2014). Logical minimisation of meta-rules within meta-interpretive learning. In Proceedings of the 24th international conference on inductive logic programming. To appear."},{"key":"5471_CR5","doi-asserted-by":"crossref","unstructured":"Davis, J., & Domingo, P. (2009). Deep transfer via second-order markov logic. In Proceedings of the twenty-sixth international conference on machine learning, pp. 217\u2013224, San Mateo, CA. Morgan Kaufmann.","DOI":"10.1145\/1553374.1553402"},{"key":"5471_CR6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0004-3702(97)00041-6","volume":"95","author":"L Raedt De","year":"1997","unstructured":"De Raedt, L. (1997). Logical seetings for concept learning. Artificial Intelligence, 95, 187\u2013201.","journal-title":"Artificial Intelligence"},{"key":"5471_CR7","doi-asserted-by":"crossref","unstructured":"De Raedt, L. (2012). Declarative modeling for machine learning and data mining. In Proceedings of the international conference on algorithmic learning theory, p. 12.","DOI":"10.1007\/978-3-642-34106-9_2"},{"key":"5471_CR8","unstructured":"De Jong, G. (1981). Generalisations based on explanations. In IJCAI-81, pp. 67\u201369. Kaufmann."},{"key":"5471_CR9","unstructured":"Driessens, K., & Ramon, J. (2003). Relational instance based regression for relational reinforcement learning. In ICML, pp. 123\u2013130."},{"issue":"1\u20132","key":"5471_CR10","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1007694015589","volume":"43","author":"S D\u017eeroski","year":"2001","unstructured":"D\u017eeroski, S., De Raedt, L., & Driessens, K. (2001). Relational reinforcement learning. Machine Learning, 43(1\u20132), 7\u201352.","journal-title":"Machine Learning"},{"key":"5471_CR11","first-page":"154","volume-title":"Proceedings of the ninth international workshop on machine learning","author":"C Feng","year":"1992","unstructured":"Feng, C., & Muggleton, S. H. (1992). Towards inductive generalisation in higher order logic. In D. Sleeman & P. Edwards (Eds.), Proceedings of the ninth international workshop on machine learning (pp. 154\u2013162). San Mateo, CA: Morgan Kaufmann."},{"key":"5471_CR12","unstructured":"Hoare, C. A. R. (1992). Programs are predicates. In Proceedings of the final fifth generation conference, pp. 211\u2013218, Tokyo. Ohmsha."},{"key":"5471_CR13","first-page":"21","volume-title":"Engineering theories of software construction","author":"CAR Hoare","year":"2001","unstructured":"Hoare, C. A. R., & Jifeng, H. (2001). Unifying theories for logic programming. In C. A. R. Hoare, M. Broy, & R. Steinbruggen (Eds.), Engineering theories of software construction (pp. 21\u201345). Leipzig: IOS Press."},{"issue":"1","key":"5471_CR14","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","volume":"1","author":"G Huet","year":"1975","unstructured":"Huet, G. (1975). A unification algorithm for typed $$\\lambda $$ \u03bb -calculus. Theoretical Computer Science, 1(1), 27\u201357.","journal-title":"Theoretical Computer Science"},{"key":"5471_CR15","doi-asserted-by":"crossref","unstructured":"Inoue, K., Furukawa, K., Kobayashiand, I., & Nabeshima, H. (2010). Discovering rules by meta-level abduction. In L. De Raedt (Ed.), Proceedings of the nineteenth international conference on inductive logic programming (ILP09) (pp. 49\u201364). Berlin: Springer. LNAI 5989.","DOI":"10.1007\/978-3-642-13840-9_6"},{"key":"5471_CR16","doi-asserted-by":"crossref","unstructured":"Katz, D., Pyuro, Y., & Brock, O. (2008). Learning to manipulate articulated objects in unstructured environments using a grounded relational representation. In Robotics: Science and systems. Citeseer.","DOI":"10.15607\/RSS.2008.IV.033"},{"key":"5471_CR17","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/B978-0-934613-41-5.50041-6","volume-title":"Proceedings of the fourth international workshop on machine learning","author":"ST Kedar-Cabelli","year":"1987","unstructured":"Kedar-Cabelli, S. T., & McCarty, L. T. (1987). Explanation-based generalization as resolution theorem proving. In P. Langley (Ed.), Proceedings of the fourth international workshop on machine learning (pp. 383\u2013389). Los Altos: Morgan Kaufmann."},{"key":"5471_CR18","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/B978-0-08-012975-4.50028-X","volume-title":"Computational problems in abstract algebra","author":"D Knuth","year":"1970","unstructured":"Knuth, D., & Bendix, P. (1970). Simple word problems in universal algebras. In J. Leech (Ed.), Computational problems in abstract algebra (pp. 263\u2013297). Oxford: Pergamon."},{"key":"5471_CR19","unstructured":"Laird, J. E. (2008). Extending the soar cognitive architecture. Frontiers in Artificial Intelligence and Applications, 171, 224\u2013235."},{"key":"5471_CR20","unstructured":"Lao, N., Mitchell, T., & Cohen, W. W. (2011). Random walk inference and learning in a large scale knowledge base. In Proceedings of the conference on empirical methods in natural language processing (EMNLP), pp. 529\u2013539."},{"key":"5471_CR21","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/1045343.1045369","volume":"63","author":"J Larson","year":"1977","unstructured":"Larson, J., & Michalski, R. S. (1977). Inductive inference of VL decision rules. ACM SIGART Bulletin, 63, 38\u201344.","journal-title":"ACM SIGART Bulletin"},{"key":"5471_CR22","unstructured":"Lin, D., Dechter, E., Ellis, K., Tenenbaum, J. B., & Muggleton, S. H. (2014). Bias reformulation for one-shot function induction. In Proceedings of the 23rd European conference on artificial intelligence (ECAI 2014) (pp. 525\u2013530). Amsterdam: IOS Press."},{"key":"5471_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-08406-9","volume-title":"Logic for learning","author":"JW Lloyd","year":"2003","unstructured":"Lloyd, J. W. (2003). Logic for learning. Berlin: Springer."},{"key":"5471_CR24","volume-title":"Machine intelligence 15: Intelligent agents","author":"J McCarthy","year":"1999","unstructured":"McCarthy, J. (1999). Making robots conscious. In K. Furukawa, D. Michie, & S. H. Muggleton (Eds.), Machine intelligence 15: Intelligent agents. Oxford: Oxford University Press."},{"key":"5471_CR25","unstructured":"Michie, D. (1994). On the rails. Computing Magazine. Magzine article text available from http:\/\/www.doc.ic.ac.uk\/~shm\/Papers\/computing.pdf"},{"key":"5471_CR26","unstructured":"Michie, D., Muggleton, S. H., Page, C. D., Page, D., & Srinivasan, A. (1994). To the international computing community: A new east-west challenge. Distributed email document available from http:\/\/www.doc.ic.ac.uk\/~shm\/Papers\/ml-chall.pdf"},{"issue":"4","key":"5471_CR27","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1093\/logcom\/1.4.497","volume":"1","author":"D Miller","year":"1991","unstructured":"Miller, D. (1991). A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 1(4), 497\u2013536.","journal-title":"Journal of Logic and Computation"},{"issue":"1","key":"5471_CR28","first-page":"47","volume":"1","author":"TM Mitchell","year":"1986","unstructured":"Mitchell, T. M., Keller, R. M., & Kedar-Cabelli, S. T. (1986). Explanation-based generalization: A unifying view. Machine Learning, 1(1), 47\u201380.","journal-title":"Machine Learning"},{"key":"5471_CR29","first-page":"205","volume-title":"Proceedings of the seventh inductive logic programming workshop (ILP97), LNAI 1297","author":"S Moyle","year":"1997","unstructured":"Moyle, S., & Muggleton, S. H. (1997). Learning programs in the event calculus. In N. Lavra\u010d & S. D\u017eeroski (Eds.), Proceedings of the seventh inductive logic programming workshop (ILP97), LNAI 1297 (pp. 205\u2013212). Berlin: Springer."},{"key":"5471_CR30","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"SH Muggleton","year":"1995","unstructured":"Muggleton, S. H. (1995). Inverse entailment and Progol. New Generation Computing, 13, 245\u2013286.","journal-title":"New Generation Computing"},{"key":"5471_CR31","doi-asserted-by":"crossref","unstructured":"Muggleton, S. H., & Buntine, W. (1988). Machine invention of first-order predicates by inverting resolution. In Proceedings of the 5th international conference on machine learning, pp. 339\u2013352. Kaufmann.","DOI":"10.1016\/B978-0-934613-64-4.50040-2"},{"key":"5471_CR32","unstructured":"Muggleton, S. H., & Lin, D. (2013). Meta-interpretive learning of higher-order dyadic datalog: Predicate invention revisited. In Proceedings of the 23rd international joint conference artificial intelligence (IJCAI 2013), pp. 1551\u20131557."},{"key":"5471_CR33","doi-asserted-by":"crossref","unstructured":"Muggleton, S. H., Lin, D., Chen, J., & Tamaddoni-Nezhad, A. (2014). Metabayes: Bayesian meta-interpretative learning using higher-order stochastic refinement. In Proceedings of the 23rd international conference on inductive logic programming, pp. 1\u201316.","DOI":"10.1007\/978-3-662-44923-3_1"},{"key":"5471_CR34","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10994-013-5358-3","volume":"94","author":"SH Muggleton","year":"2014","unstructured":"Muggleton, S. H., Lin, D., Pahlavi, N., & Tamaddoni-Nezhad, A. (2014). Meta-interpretive learning: Application to grammatical inference. Machine Learning, 94, 25\u201349.","journal-title":"Machine Learning"},{"issue":"20","key":"5471_CR35","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19","author":"SH Muggleton","year":"1994","unstructured":"Muggleton, S. H., & De Raedt, L. (1994). Inductive logic programming: Theory and methods. Journal of Logic Programming, 19(20), 629\u2013679.","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"5471_CR36","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10994-011-5259-2","volume":"86","author":"SH Muggleton","year":"2011","unstructured":"Muggleton, S. H., De Raedt, L., Poole, D., Bratko, I., Flach, P., & Inoue, K. (2011). ILP turns 20: Biography and future challenges. Machine Learning, 86(1), 3\u201323.","journal-title":"Machine Learning"},{"key":"5471_CR37","doi-asserted-by":"crossref","unstructured":"Nienhuys-Cheng, S-H., & de Wolf, R. (1997). Foundations of inductive logic programming, LNAI 1228. Berlin: Springer.","DOI":"10.1007\/3-540-62927-0"},{"key":"5471_CR38","doi-asserted-by":"crossref","unstructured":"Otero, R. (2005). Induction of the indirect effects of actions by monotonic methods. In Proceedings of the fifteenth international conference on inductive logic programming (ILP05), volume 3625, pp. 279\u2013294. Berlin: Springer.","DOI":"10.1007\/11536314_17"},{"key":"5471_CR39","unstructured":"Pahlavi, N., & Muggleton, S. H. (2012). Towards efficient higher-order logic learning in a first-order datalog framework. In Latest advances in inductive logic programming. London: Imperial College Press."},{"key":"5471_CR40","unstructured":"Pasula, H., Zettlemoyer, L. S., & Kaelbling, L. P. (2004). Learning probabilistic relational planning rules. In ICAPS, pp. 73\u201382."},{"key":"5471_CR41","first-page":"239","volume":"5","author":"JR Quinlan","year":"1990","unstructured":"Quinlan, J. R. (1990). Learning logical definitions from relations. Machine Learning, 5, 239\u2013266.","journal-title":"Machine Learning"},{"key":"5471_CR42","unstructured":"Rouveirol, C., & Puget, J-F. (1989). A simple and general solution for inverting resolution. In EWSL-89, pp. 201\u2013210, London. Pitman."},{"key":"5471_CR43","volume-title":"Artificial intelligence: A modern approach","author":"SJ Russell","year":"2010","unstructured":"Russell, S. J., & Norvig, P. (2010). Artificial intelligence: A modern approach (3rd ed.). New Jersey: Pearson.","edition":"3"},{"key":"5471_CR44","unstructured":"Sorower, M. S., Doppa, J. R., Orr, W., Tadepalli, P., Dietterich, T. G., & Fern, X. Z. (2011). Inverting grice\u2019s maxims to learn rules from natural language extractions. In Advances in neural information processing systems, pp. 1053\u20131061"},{"key":"5471_CR45","volume-title":"The ALEPH manual","author":"A Srinivasan","year":"2001","unstructured":"Srinivasan, A. (2001). The ALEPH manual. Oxford: Machine Learning at the Computing Laboratory, Oxford University."},{"key":"5471_CR46","unstructured":"Stahl, I. (1992). Constructive induction in inductive logic programming: An overview. Technical report, Fakultat Informatik, Universitat Stuttgart."},{"key":"5471_CR47","volume-title":"Reinforcement learning: An introduction","author":"RS Sutton","year":"1998","unstructured":"Sutton, R. S., & Barto, A. G. (1998). Reinforcement learning: An introduction (Vol. 1). Cambridge: Cambridge University Press."},{"issue":"2","key":"5471_CR48","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01932293","volume":"17","author":"S-A T\u00e4rnlund","year":"1977","unstructured":"T\u00e4rnlund, S.-A. (1977). Horn clause computability. BIT Numerical Mathematics, 17(2), 215\u2013226.","journal-title":"BIT Numerical Mathematics"},{"key":"5471_CR49","unstructured":"Turney, P. (1995). Low size-complexity inductive logic programming: The east\u2013west challenge considered as a problem in cost-sensitive classification. NRC report\u00a0cs\/0212039, National Research Council of Canada."},{"key":"5471_CR50","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM, 27, 1134\u20131142.","journal-title":"Communications of the ACM"},{"key":"5471_CR51","doi-asserted-by":"crossref","unstructured":"Wang, W. Y., Mazaitis, K., & Cohen, W. W. (2013). Programming with personalized pagerank: A locally groundable first-order probabilistic logic. In Proceedings of the 22Nd ACM international conference on conference on information & #38; knowledge management, CIKM \u201913 (pp. 2129\u20132138). New York, NY: ACM.","DOI":"10.1145\/2505515.2505573"},{"key":"5471_CR52","doi-asserted-by":"crossref","unstructured":"Yamamoto, A. (1997). Which hypotheses can be found with inverse entailment? In N. Lavra\u010d & S. D\u017eeroski (Eds.), Proceedings of the seventh international workshop on inductive logic programming, LNAI 1297 (pp. 296\u2013308). Berlin: Springer.","DOI":"10.1007\/3540635149_58"},{"key":"5471_CR53","doi-asserted-by":"crossref","unstructured":"Zhang, T., Sipma, H., & Manna, Z. (2005). The decidability of the first-order theory of Knuth\u2013Bendix order. In Automated deduction-CADE-20 (pp. 738\u2013738). Berlin: Springer.","DOI":"10.1007\/11532231_10"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-014-5471-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-014-5471-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-014-5471-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T18:01:07Z","timestamp":1691517667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-014-5471-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,12]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["5471"],"URL":"https:\/\/doi.org\/10.1007\/s10994-014-5471-y","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,12]]}}}