{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T05:13:48Z","timestamp":1739337228601,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040191"},{"type":"electronic","value":"9783642040207"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04020-7_58","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T18:43:19Z","timestamp":1252953799000},"page":"546-555","source":"Crossref","is-referenced-by-count":0,"title":["Learning Hereditary and Reductive Prolog Programs from Entailment"],"prefix":"10.1007","author":[{"given":"Shahid","family":"Hussain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. R. K. Krishna","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"58_CR1","unstructured":"Hussain, S.: Learnability Results for Elementry Formal Systems. Ms thesis, King Fahd University of Petroleum and Minerals (2007)"},{"key":"58_CR2","unstructured":"Hussain, S.: Learnability Results for Elementary Formal Systems: EFS and Prolog programs. VDM Verlag Dr. M\u00fcller (2009)"},{"key":"58_CR3","unstructured":"Shapiro, E.Y.: Inductive Inference of Theories from Facts. Technical Report RR 192, Yale University (1981)"},{"key":"58_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1192.001.0001","volume-title":"Algorithmic Program Debugging","author":"E. Shapiro","year":"1983","unstructured":"Shapiro, E.: Algorithmic Program Debugging. MIT Press, Cambridge (1983)"},{"issue":"20","key":"58_CR5","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19","author":"S. Muggleton","year":"1994","unstructured":"Muggleton, S., Raedt, L.: Inductive logic programming: Theory and methods. Journal of Logic Programming\u00a019(20), 629\u2013679 (1994)","journal-title":"Journal of Logic Programming"},{"key":"58_CR6","unstructured":"Angluin, D.: Learning with hints. In: COLT 1988: Proceedings of The Second Annual Workshop on Computational Learning Theory, pp. 167\u2013181 (1988)"},{"issue":"4","key":"58_CR7","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D.: Queries and Concept Learning. Machine Learning,\u00a02(4), 319\u2013342 (1988)","journal-title":"Machine Learning,"},{"key":"58_CR8","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1007\/3-540-63577-7_59","volume-title":"Algorithmic Learning Theory","author":"H. Arimura","year":"1997","unstructured":"Arimura, H.: Learning Acyclic First-order Horn Sentences from Entailment. In: Li, M. (ed.) ALT 1997. LNCS, vol.\u00a01316, pp. 432\u2013445. Springer, Heidelberg (1997)"},{"key":"58_CR9","doi-asserted-by":"crossref","unstructured":"Frazier, M., Pitt, L.: Learning from Entailment: An Application to Propositional Horn Sentences. In: ICML 1993: Proceedings of International Conference on Machine Learning, pp. 120\u2013127 (1993)","DOI":"10.1016\/B978-1-55860-307-3.50022-8"},{"key":"58_CR10","first-page":"29","volume-title":"Inductive Logic Programming.","author":"C.D. Page Jr.","year":"1992","unstructured":"Page Jr., C.D., Frisch, A.: Generalization and Learnability: A Study of Constrained Atoms. In: Muggleton, S.H. (ed.) Inductive Logic Programming., pp. 29\u201361. Academic Press, London (1992)"},{"key":"58_CR11","doi-asserted-by":"crossref","unstructured":"Reddy, C., Tadepalli, P.: Learning first order acyclic Horn programs from entailment. In: ILP 1998: Proceedings of Internaional Workshop on Logic Programming, pp. 23\u201337 (1998)","DOI":"10.1007\/BFb0027308"},{"key":"58_CR12","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/BFb0095294","volume-title":"PRICAI\u201998: Topics in Artificial Intelligence","author":"M.R.K. Krishna Rao","year":"1998","unstructured":"Krishna Rao, M.R.K., Sattar, A.: Learning Linearly-moded Programs from Entailment. In: Lee, H.-Y. (ed.) PRICAI 1998. LNCS (LNAI), vol.\u00a01531, pp. 482\u2013493. Springer, Heidelberg (1998)"},{"key":"58_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(00)00270-X","volume":"268","author":"M.R.K. Krishna Rao","year":"2001","unstructured":"Krishna Rao, M.R.K., Sattar, A.: Polynomial-time Learnability of Logic Programs with Local Variables from entailment. Theoretical Computer Science\u00a0268, 179\u2013198 (2001)","journal-title":"Theoretical Computer Science"},{"key":"58_CR14","volume-title":"The Art of Prolog","author":"L. Sterling","year":"1994","unstructured":"Sterling, L., Shapiro, E.: The Art of Prolog, 2nd edn. MIT Press, Cambridge (1994)","edition":"2"},{"issue":"1","key":"58_CR15","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.: Learning Closed Horn Expressions. Information and Computation\u00a0178(1), 214\u2013240 (2002)","journal-title":"Information and Computation"},{"key":"58_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(99)00271-6","volume":"241","author":"M.R.K. Krishna Rao","year":"2000","unstructured":"Krishna Rao, M.R.K.: Some Classes of Prolog Programs Inferable from Positive Data. Theoretical Computer Science\u00a0241, 211\u2013234 (2000)","journal-title":"Theoretical Computer Science"},{"key":"58_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-96826-6","volume-title":"Foundations of Logic Programming","author":"J. Lloyd","year":"1984","unstructured":"Lloyd, J.: Foundations of Logic Programming. Springer, Berlin (1984)"},{"key":"58_CR18","first-page":"493","volume-title":"Handbook of Theoretical Computer Science: Formal Models and Semantics","author":"K.R. Apt","year":"1990","unstructured":"Apt, K.R.: Logic programming. In: Handbook of Theoretical Computer Science: Formal Models and Semantics, vol.\u00a0B, pp. 493\u2013574. MIT Press, Cambridge (1990)"},{"key":"58_CR19","unstructured":"Nienhuys-Cheng, S.H., De Wolf, R.: The Subsumption Theorem for Several Forms of Resolution (1995)"}],"container-title":["Lecture Notes in Computer Science","Emerging Intelligent Computing Technology and Applications. With Aspects of Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04020-7_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T04:19:06Z","timestamp":1739333946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04020-7_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040191","9783642040207"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04020-7_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}