{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:20:25Z","timestamp":1752229225088},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540635147"},{"type":"electronic","value":"9783540695875"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3540635149_53","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:28:05Z","timestamp":1330298885000},"page":"243-255","source":"Crossref","is-referenced-by-count":8,"title":["Learning Horn definitions with equivalence and membership queries"],"prefix":"10.1007","author":[{"given":"Chandra","family":"Reddy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prasad","family":"Tadepalli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,10]]},"reference":[{"key":"24_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. 1993.Kanfer-Ackerman Air Traffic Control Task \u00a9 CD-ROM Database, Data-Collection Program, and Playback Program. Dept. of Psychology, Univ. of Minn., Minneapolis, MN."},{"key":"24_CR2","first-page":"147","volume":"9","author":"D. Angluin","year":"1992","unstructured":"Angluin, D.; Frazier, M.; and Pitt, L. 1992. Learning conjunctions of horn clauses. Machine Learning 9:147\u2013164.","journal-title":"Machine Learning"},{"key":"24_CR3","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D. 1988. Queries and concept learning. Machine Learning 2:319\u2013342.","journal-title":"Machine Learning"},{"issue":"1","key":"24_CR4","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. 1995a. Pac-learning non-recursive prolog clauses. Artificial Intelligence 79(1):1\u201338.","journal-title":"Artificial Intelligence"},{"key":"24_CR5","first-page":"500","volume":"2","author":"W. Cohen","year":"1995","unstructured":"Cohen, W. 1995b. Pac-learning recursive logic programs: efficient algorithms. Jl. of AI Research 2:500\u2013539.","journal-title":"Jl. of AI Research"},{"key":"24_CR6","first-page":"541","volume":"2","author":"W. Cohen","year":"1995","unstructured":"Cohen, W. 1995c. Pac-learning recursive logic programs: negative results. Jl. of AZ Research 2:541\u2013573.","journal-title":"Jl. of AZ Research"},{"issue":"2","key":"24_CR7","first-page":"107","volume":"8","author":"L. Raedt De","year":"1992","unstructured":"De Raedt, L., and Bruynooghe, M. 1992. Interactive concept learning and constructive induction by analogy. Machine Learning 8(2):107\u2013150.","journal-title":"Machine Learning"},{"key":"24_CR8","unstructured":"D\u017eeroski, S.; Muggleton, S.; and Russell, S. 1992. Pac-learnability of determinate logic programs. In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 128\u2013135."},{"key":"24_CR9","unstructured":"Erol, K.; Hendler, J.; and Nau, D. 1994. HTN planning: complexity and expressivity. In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-g4). AAAI Press."},{"key":"24_CR10","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. 1972. Learning and executing generalized robot plans. Artificial Intelligence 3:251\u2013288.","journal-title":"Artificial Intelligence"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Frazier, M., and Pitt, L. 1993. Learning from entailment: An application to propositional Horn sentences. In Proceedings of the Tenth International Conference on Machine Learning, 120\u2013127.","DOI":"10.1016\/B978-1-55860-307-3.50022-8"},{"key":"24_CR12","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/A:1026443024002","volume":"26","author":"M. Frazier","year":"1996","unstructured":"Frazier, M., and Pitt, L. 1996. CLASSIC learning. Machine Learning 26:151\u2013194.","journal-title":"Machine Learning"},{"key":"24_CR13","first-page":"7","volume":"4","author":"D. Haussler","year":"1989","unstructured":"Haussler, D. 1989. Learning conjunctive concepts in structural domains. Machine Learning 4:7\u201340.","journal-title":"Machine Learning"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Kietz, J.-U., and L\u00fcbbe, M. 1994. An efficient subsumption algorithm for inductive logic programming. In Proceedings of the Eleventh International Conference on Machine Learning, 130\u2013138.","DOI":"10.1016\/B978-1-55860-335-6.50024-6"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Kowalski, R. 1970. The case for using equality axioms in automatic demonstration. In Lecture Notes in Mathematics, volume 125. Springer-Verlag.","DOI":"10.1007\/BFb0060628"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Lassez, J.-L.; Maher, M.; and Marriott, K. 1988. Unification revisited. In Minker, J., ed., Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann.","DOI":"10.1016\/B978-0-934613-40-8.50019-1"},{"key":"24_CR17","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. 1987. Foundations of Logic Programming (2nd ed.). Berlin: Springer-Verlag.","edition":"2nd ed."},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Mitchell, T.; Utgoff, P.; and Banerji, R. 1983. Learning by experimentation: Acquiring and refining problem-solving heuristics. In Michalski, R., and et al., eds., Machine learning: An artificial intelligence approach, volume 1. Morgan Kaufmann.","DOI":"10.1007\/978-3-662-12405-5_6"},{"key":"24_CR19","unstructured":"Muggleton, S., and Feng, C. 1990. Efficient induction of logic programs. In Proceedings of the First Conference on Algorithmic Learning Theory, 368\u2013381. Ohmsha\/Springer-Verlag."},{"key":"24_CR20","first-page":"341","volume":"4","author":"S.-H. Nienhuys-Cheng","year":"1996","unstructured":"Nienhuys-Cheng, S.-H., and de Wolf, R. 1996. Least generalizations and greatest specializations of sets of clauses. Jl. of AI Research 4:341\u2013363.","journal-title":"Jl. of AI Research"},{"key":"24_CR21","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. Page","year":"1993","unstructured":"Page, C. 1993. Anti-Unification in Constraint Logics: Foundations and Applications to Learnability in First-Order Logic, to Speed-up Learning, and to Deduction. Ph.D. Dissertation, University of Illinois, Urbana, IL."},{"key":"24_CR22","first-page":"153","volume-title":"Machine Intelligence","author":"G. Plotkin","year":"1970","unstructured":"Plotkin, G. 1970. A note on inductive generalization. In Meltzer, B., and Michie, D., eds., Machine Intelligence, volume 5. New York: Elsevier NorthHolland. 153\u2013163."},{"key":"24_CR23","unstructured":"Reddy, C., and Tadepalli, P. 1997a. Inductive logic programming for speedup learning. To appear in IJCAI-97 workshop on Frontiers of ILP."},{"key":"24_CR24","unstructured":"Reddy, C., and Tadepalli, P. 1997b. Learning goaldecomposition rules using exercises. In Proceedings of the 14th International Conference on Machine Learning. Morgan Kaufmann."},{"key":"24_CR25","unstructured":"Reddy, C.; Tadepalli, P.; and Roncagliolo, S. 1996. Theory-guided empirical speedup learning of goal-decomposition rules. In Proceedings of the 13th International Conference on Machine Learning, 409\u2013417. Morgan Kaufmann."},{"key":"24_CR26","first-page":"197","volume":"5","author":"R. Schapire","year":"1990","unstructured":"Schapire, R. 1990. The strength of weak learnability. Machine Learning 5:197\u2013227.","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3540635149_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:42Z","timestamp":1605647922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3540635149_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540635147","9783540695875"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3540635149_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}