{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T19:10:11Z","timestamp":1736536211765,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540647911"},{"type":"electronic","value":"9783540686736"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054923","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T09:10:55Z","timestamp":1153991455000},"page":"303-315","source":"Crossref","is-referenced-by-count":0,"title":["PAC learning conceptual graphs"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Jappy","sequence":"first","affiliation":[]},{"given":"Richard","family":"Nock","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,27]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Learnability and the vapnik-chervonenkis dimension. J. ACM, pages 929\u2013965, 1989.","DOI":"10.1145\/76359.76371"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0364-0213(85)80014-8","volume":"9","author":"R. J. Brachman","year":"1985","unstructured":"R. J. Brachman and J. Schmolze. An overview of the kl-one knowledge representation system. Cognitive Science, 9: 171\u2013216, 1985.","journal-title":"Cognitive Science"},{"key":"23_CR3","unstructured":"M. Chein and M.L. Mugnier. Conceptual graphs: Fundamental notions. Revue d'Intelligence Artificielle, pages 365\u2013406, 1992."},{"key":"23_CR4","unstructured":"W. W. Cohen. Pac-learning non-determinate clauses. In Proc. of AAAI-94, pages 676\u2013681, 1994."},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"W. W. Cohen and H. Hirsh. The learnability of Description Logic with equality constrain ts. Machine Learning, pages 169\u2013199, 1994.","DOI":"10.1007\/BF00993470"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"S. Dzeroski, S. Muggleton, and S. Russel. Pac-learning of determinate logic programs. In Proc. of the 5 th International Conference on Computational Theory, pages 128\u2013137, 1992.","DOI":"10.1145\/130385.130399"},{"key":"23_CR7","unstructured":"D. Genest. Document retrieval: An approach based on conceptual graphs. Rapport de Recherche LIRMM No 97296, 1998."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"E.M. Gold. Language identification in the limit. Information and Control, 10: 447\u2013474, 1967.","journal-title":"Information and Control"},{"key":"23_CR9","first-page":"7","volume":"4","author":"D. Haussler","year":"1989","unstructured":"D. Haussler. Learning conjunctive concepts in structural domains. Machine Learning, 4: 7\u201340, 1989.","journal-title":"Machine Learning"},{"key":"23_CR10","unstructured":"P. Jappy and O. Gascuel. On the conputational hardness of learning from structured symbolic data. In Proceedings of the 6th Internationl Conference on Ordinal and Symbolic Data Analysis, OSDA95, pages 128\u2013143, 1995."},{"key":"23_CR11","unstructured":"P. Jappy, R. Nock, and O. Gascuel. Negative robust learning results for horn clause programs. In Proc. of the 13 th International Conference on Machine Learning, 1996."},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"J.U. Kietz. Some lower bounds for the computational complexity of inductive logic programming. In European Conference on Machine Learning, ECML'93, pages 115\u2013123, 1993.","DOI":"10.1007\/3-540-56602-3_131"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0004-3702(93)90068-M","volume":"61","author":"R.K. Lindzay","year":"1993","unstructured":"R.K. Lindzay, B.G. Buchanan, E.A. Feigenbaum, and J. Lederberg. Dendral: a case study of the first expert system for scientific hypothesis formation. Artificial Intelligence, 61: 209\u2013261, 1993.","journal-title":"Artificial Intelligence"},{"key":"23_CR14","unstructured":"M. Liqui\u00e8re. Apprentissage \u00e0 partir d'objets structur\u00e9s. Conception et R\u00e9alisation. PhD thesis, Universit\u00e9 de Montpellier II, 1990."},{"key":"23_CR15","volume-title":"Inductive Logic Programming","author":"S.H. Muggleton","year":"1992","unstructured":"S.H. Muggleton. Inductive Logic Programming. Academic Press. New York, 1992."},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"S.H. Muggleton. Bayesian inductive logic programming. In COLT94, pages 3\u201311, 1994.","DOI":"10.1145\/180139.178095"},{"key":"23_CR17","unstructured":"M.L. Mugnier and M. Chein. Polynomial algorithms for projection and matching. In Proc. of the 7th Workshop on Conceptual Structures, pages 68\u201376, 1992."},{"key":"23_CR18","unstructured":"R.H. Richens. Preprogramming for mechanical translation. Mechanical Translation, 3, 1956."},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"R.L. Rivest. Learning decision lists. Machine Learning, pages 229\u2013246, 1987.","DOI":"10.1007\/BF00058680"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"E. Salvat and M.L. Mugnier. Sound and complete forward and backward chaining of graph rules. In Proceeding of the International Conference on Conceptual Structures, ICCS96, pages 248\u2013262, 1996.","DOI":"10.1007\/3-540-61534-2_16"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"R. Shapire. The strength of weak learning. Machine Learning, 5(2), 1990.","DOI":"10.1007\/BF00116037"},{"key":"23_CR22","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1192.001.0001","volume-title":"Algorithmic Program Debugging","author":"E.Y. Shapiro","year":"1983","unstructured":"E.Y. Shapiro. Algorithmic Program Debugging. Academic Press. New York, 1983."},{"key":"23_CR23","unstructured":"J.F. Sowa. Conceptual Structures \u2014 Information Processinf in Mind and Machine. Addison-Wesley, 1984."},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"L. G. Valiant. A theory of the learnable. Communications of the ACM, pages 1134\u20131142, 1984.","DOI":"10.1145\/1968.1972"},{"key":"23_CR25","unstructured":"L. G. Valiant. Learning disjunctions of conjunctions. In Proc. of the 9 th IJCAI, pages 560\u2013566, 1985."}],"container-title":["Lecture Notes in Computer Science","Conceptual Structures: Theory, Tools and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054923","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T03:16:21Z","timestamp":1736478981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054923"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647911","9783540686736"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/bfb0054923","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}