{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,9]],"date-time":"2023-10-09T22:49:52Z","timestamp":1696891792604},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[1999,3]]},"DOI":"10.1007\/bf03037583","type":"journal-article","created":{"date-parts":[[2009,4,24]],"date-time":"2009-04-24T03:31:34Z","timestamp":1240543894000},"page":"77-98","source":"Crossref","is-referenced-by-count":12,"title":["Learning Horn definitions: Theory and an application to planning"],"prefix":"10.1007","volume":"17","author":[{"given":"Chandra","family":"Reddy","sequence":"first","affiliation":[]},{"given":"Prasad","family":"Tadepalli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF03037583_CR1","volume-title":"Kanfer-Ackerman Air Traffic Control Task\u00a9 CD-ROM Database, Data-Collection Program, and Playback Program","author":"P. Ackerman","year":"1993","unstructured":"Ackerman, P. and Kanfer, R.,Kanfer-Ackerman Air Traffic Control Task\u00a9 CD-ROM Database, Data-Collection Program, and Playback Program, Dept. of Psychology, Univ. of Minn., Minneapolis, MN, 1993."},{"key":"BF03037583_CR2","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D., \u201cQueries and Concept Learning,\u201dMachine Learning 2, pp. 319\u2013342, 1988.","journal-title":"Machine Learning"},{"key":"BF03037583_CR3","first-page":"147","volume":"9","author":"D. Angluin","year":"1992","unstructured":"Angluin, D., Frazier, M. and Pitt, L., \u201cLearning conjunctions of Horn clauses,\u201dMachine Learning 9, pp. 147\u2013164, 1992.","journal-title":"Machine Learning"},{"key":"BF03037583_CR4","doi-asserted-by":"crossref","unstructured":"Arimura, H., \u201cLearning Acyclic First-order Horn Sentences From Entailment,\u201d inProceedings of the Eight International Workshop on Algorithmic Learning Theory, Ohmsha\/Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63577-7_59"},{"issue":"1","key":"BF03037583_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(94)00034-4","volume":"79","author":"W. Cohen","year":"1995","unstructured":"Cohen, W., \u201cPac-learning non-recursive prolog clauses,\u201dArtificial Intelligence 79, 1, pp. 1\u201338, 1995.","journal-title":"Artificial Intelligence"},{"key":"BF03037583_CR6","first-page":"500","volume":"2","author":"W. Cohen","year":"1995","unstructured":"Cohen, W., \u201cPac-learning recursive logic programs: efficient algorithms,\u201dJl. of AI Research 2, pp. 500\u2013539, 1995.","journal-title":"Jl. of AI Research"},{"key":"BF03037583_CR7","first-page":"541","volume":"2","author":"W. Cohen","year":"1995","unstructured":"Cohen, W., \u201cPac-learning recursive logic programs: negative results,\u201dJl. of AI Research 2, pp. 541\u2013573, 1995.","journal-title":"Jl. of AI Research"},{"issue":"1","key":"BF03037583_CR8","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., \u201cLogical Settings for Concept Learning,\u201dArtificial Intelligence 95, 1, pp. 187\u2013201, 1997.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"BF03037583_CR9","first-page":"107","volume":"8","author":"L. Raedt De","year":"1992","unstructured":"De Raedt, L. and Bruynooghe, M., \u201cInteractive concept learning and constructive induction by analogy,\u201dMachine Learning 8, 2, pp. 107\u2013150, 1992.","journal-title":"Machine Learning"},{"key":"BF03037583_CR10","doi-asserted-by":"crossref","unstructured":"D\u017eeroki, S., Muggleton, S. and Russell, S., \u201cPAC-learnability of Determinate Logic Programs,\u201d inProceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, pp. 128\u2013135, 1992.","DOI":"10.1145\/130385.130399"},{"key":"BF03037583_CR11","unstructured":"Erol, K., Hendler, J. and Nau, D., \u201cHTN planning: complexity and expressivity,\u201d inProceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), AAAI Press, 1994."},{"key":"BF03037583_CR12","unstructured":"Estlin, T. and Mooney, R., \u201cMulti-strategy Learning of Search Control for Partial-Order Planning,\u201d inProceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), AAAI\/MIT Press, pp. 843\u2013848, 1996."},{"key":"BF03037583_CR13","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0004-3702(72)90051-3","volume":"3","author":"R. Fikes","year":"1972","unstructured":"Fikes, R., Hart, P. and Nilsson, N., \u201cLearning and executing generalized robot plans,\u201dArtificial Intelligence 3, pp. 251\u2013288, 1972.","journal-title":"Artificial Intelligence"},{"key":"BF03037583_CR14","unstructured":"Frazier, M. and Page, C. D., \u201cLearnability in Inductive Logic Programming: Some Basic Results and Techniques,\u201d inProceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93), AAAI Press, pp. 120\u2013127, 1993."},{"key":"BF03037583_CR15","doi-asserted-by":"crossref","unstructured":"Frazier, M. and Pitt, L., \u201cLearning from entailment: An application to propositional Horn sentences,\u201d inProceedings of the Tenth International Conference on Machine Learning, pp. 120\u2013127, 1993.","DOI":"10.1016\/B978-1-55860-307-3.50022-8"},{"key":"BF03037583_CR16","first-page":"151","volume":"25","author":"M. Frazier","year":"1995","unstructured":"Frazier, M. and Pitt, L., \u201cClassic learning,\u201dMachine Learning 25, pp. 151\u2013194, 1995.","journal-title":"Machine Learning"},{"key":"BF03037583_CR17","first-page":"7","volume":"4","author":"D. Haussler","year":"1989","unstructured":"Haussler, D., \u201cLearning Conjunctive Concepts in Structural Domains,\u201dMachine Learning 4, pp. 7\u201340, 1989.","journal-title":"Machine Learning"},{"key":"BF03037583_CR18","doi-asserted-by":"crossref","unstructured":"Kietz, J.-U. and L\u00fcbbe, M., \u201cAn efficient subsumption algorithm for inductive logic programming,\u201d inProceedings of the Eleventh International Conference on Machine Learning, pp. 130\u2013138, 1994.","DOI":"10.1016\/B978-1-55860-335-6.50024-6"},{"key":"BF03037583_CR19","doi-asserted-by":"crossref","unstructured":"Kowalski, R., \u201cThe case for using equality axioms in automatic demonstration,\u201d inLecture Notes in Mathematics, volume 125, Springer-Verlag, 1970.","DOI":"10.1007\/BFb0060628"},{"key":"BF03037583_CR20","doi-asserted-by":"crossref","unstructured":"Lassez, J.-L., Maher, M. and Marriott, K., \u201cUnification revisited,\u201d inFoundations of Deductive Databases and Logic Programming (J. Minker ed.), Morgan Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50019-1"},{"key":"BF03037583_CR21","unstructured":"Leckie, C. and Zukerman, I., \u201cAn inductive approach to learning search control rules for planning,\u201d inProceedings of the 13th IJCAI, pp. 1100\u20131105, 1993."},{"key":"BF03037583_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J. Lloyd","year":"1987","unstructured":"Lloyd, J.,Foundations of Logic Programming (2nd ed.), Springer-Verlag, Berlin, 1987.","edition":"2nd ed."},{"key":"BF03037583_CR23","unstructured":"Muggleton, S. and Feng, C., \u201cEfficient induction of logic programs,\u201d inProceedings of the First Conference on Algorithmic Learning Theory, Ohmsha\/Springer-Verlag, pp. 368\u2013381, 1990."},{"key":"BF03037583_CR24","first-page":"341","volume":"4","author":"S.-H. Nienhuys-Cheng","year":"1996","unstructured":"Nienhuys-Cheng, S.-H. and de Wolf, R., \u201cLeast Generalizations and Greatest Specializations of Sets of Clauses,\u201dJl. of AI Research 4, pp. 341\u2013363, 1996.","journal-title":"Jl. of AI Research"},{"key":"BF03037583_CR25","volume-title":"Anti-Unification in Constraint Logics: Foundations and Applications to Learnability in First-Order Logic, to Speed-up Learning, and to Deduction","author":"C. D. Page","year":"1993","unstructured":"Page, C. D.,Anti-Unification in Constraint Logics: Foundations and Applications to Learnability in First-Order Logic, to Speed-up Learning, and to Deduction, Ph.D. thesis, University of Illinois, Urbana, IL, 1993."},{"key":"BF03037583_CR26","unstructured":"Page, C. D. and Frisch, A. M., \u201cGeneralization and Learnability: A Study of Constrained Atoms,\u201d inInductive Logic Programming (S. H. Muggleton ed.), Academic Press, pp. 29\u201361, 1992."},{"key":"BF03037583_CR27","first-page":"153","volume-title":"Machine Intelligence","author":"G. Plotkin","year":"1970","unstructured":"Plotkin, G., \u201cA Note on Inductive Generalization,\u201d inMachine Intelligence (B. Meltzer and D. Michie eds.), volume 5, Elsevier North-Holland, New York, pp. 153\u2013163, 1970."},{"key":"BF03037583_CR28","first-page":"239","volume":"5","author":"J. Quinlan","year":"1990","unstructured":"Quinlan, J., \u201cLearning logical definitions of from relations,\u201dMachine Learning, 5, pp. 239\u2013266, 1990.","journal-title":"Machine Learning"},{"key":"BF03037583_CR29","unstructured":"Reddy, C. and Tadepalli, P., \u201cInductive logic programming for speedup learning,\u201d inProceedings of the IJCAI-97 workshop on Frontiers of Inductive Logic Programming (L. DeRaedt and S. Muggleton eds.), 1997."},{"key":"BF03037583_CR30","unstructured":"Reddy, C. and Tadepalli, P., \u201cLearning Goal-Decomposition Rules using Exercises,\u201d inProceedings of the 14th International Conference on Machine Learning, Morgan Kaufmann, 1997."},{"key":"BF03037583_CR31","doi-asserted-by":"crossref","unstructured":"Reddy, C. and Tadepalli, P., \u201cLearning First-Order Acyclic Horn Programs from Entailment,\u201d inProceedings of the 15th International Conference on Machine Learning; (and Proceedings of the 8th International Conference on Inductive Logic Programming), Morgan Kaufmann, 1998.","DOI":"10.1007\/BFb0027308"},{"key":"BF03037583_CR32","unstructured":"Reddy, C., Tadepalli, P. and Roncagliolo, S., \u201cTheory-Guided Empirical Speedup Learning of Goal-Decomposition Rules,\u201d, inProceedings of the 13th International Conference on Machine Learning, Morgan Kaufmann, pp. 409\u2013417, 1996."},{"key":"BF03037583_CR33","first-page":"197","volume":"5","author":"R. Schapire","year":"1990","unstructured":"Schapire, R., \u201cThe strength of weak learnability,\u201dMachine Learning 5, pp. 197\u2013227, 1990.","journal-title":"Machine Learning"},{"key":"BF03037583_CR34","unstructured":"Zelle, J. and Mooney, R., \u201cCombining FOIL and EBG to speedup logic programs,\u201d, inProceedings of the 13th IJCAI, pp. 1106\u20131111, 1993."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037583.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037583\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037583","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:52:40Z","timestamp":1558572760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037583"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["BF03037583"],"URL":"https:\/\/doi.org\/10.1007\/bf03037583","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}