{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:10Z","timestamp":1725663970707},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573708"},{"type":"electronic","value":"9783540480969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57370-4_39","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:56:20Z","timestamp":1330260980000},"page":"87-100","source":"Crossref","is-referenced-by-count":9,"title":["Case-based representation and learning of pattern languages"],"prefix":"10.1007","author":[{"given":"Klaus P.","family":"Jantke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steffen","family":"Lange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"7_CR1","unstructured":"David W. Aha. Case-based learning algorithms. In DARPA Workshop on Case Based Reasoning, pages 147\u2013157. Morgan Kaufmann, 1991."},{"key":"7_CR2","first-page":"37","volume":"6","author":"D. W. Aha","year":"1991","unstructured":"David W. Aha, Dennis Kibler, and Marc K. Albert. Instance-based learning algorithms. Machine Learning, 6:37\u201366, 1991.","journal-title":"Machine Learning"},{"key":"7_CR3","first-page":"618","volume-title":"A machine discovery from amino acid sequences by decision trees over regular patterns","author":"S. Arikawa","year":"1992","unstructured":"Setsuo Arikawa, Satoru Kuhara, Satoru Miyano, Yasuhito Mukouchi, Ayumi Shinohara, and Takeshi Shinohara. A machine discovery from amino acid sequences by decision trees over regular patterns. In Intern. Conference on Fifth Generation Computer Systems, June 1\u20135, 1992, volume 2, pages 618\u2013625. Institute for New Generation Computer Technology (ICOT), Tokyo, Japan, 1992."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Dana Angluin. Finding patterns common to a set of strings. Journal of Computer and System Sciences, 21:46\u201362, 1980.","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D. Angluin","year":"1983","unstructured":"Dana Angluin and Carl H. Smith. A survey of inductive inference: Theory and methods. Computing Surveys, 15:237\u2013269, 1983.","journal-title":"Computing Surveys"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"14","author":"E. M. Gold","year":"1967","unstructured":"E. Mark Gold. Language identification in the limit. Information and Control, 14:447\u2013474, 1967.","journal-title":"Information and Control"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Klaus P. Jantke. Polynomial time inference of general pattern languages. In M. Fontet\/ K. Mehlhorn, editor, STACS'84, Lecture Notes in Computer Science 166, pages 314\u2013325. Springer-Verlag, 1984.","DOI":"10.1007\/3-540-12920-0_29"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Klaus P. Jantke. Algorithmic learning from incomplete information: Principles and problems. In J. Dassow and J. Kelemen, editors, Machines, Languages, and Complexity, Lecture Notes in Computer Science, pages 188\u2013207. Springer-Verlag, 1989.","DOI":"10.1007\/BFb0015939"},{"issue":"4","key":"7_CR9","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF03037092","volume":"8","author":"K. P. Jantke","year":"1991","unstructured":"Klaus P. Jantke. Monotonic and non-monotonic inductive inference. New Generation Computing, 8(4):349\u2013360, 1991.","journal-title":"New Generation Computing"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Klaus P. Jantke. Monotonic and nonmonotonic inductive inference of functions and patterns. In K.P. Jantke J. Dix and P.H. Schmitt, editors, Nonmonotonic and Inductive Logic, 1st Int. Workshop, Lecture Notes in Artificial Intelligence 543, pages 161\u2013177. Springer-Verlag, 1991.","DOI":"10.1007\/BFb0023322"},{"key":"7_CR11","first-page":"218","volume-title":"Case based learning in inductive inference","author":"K. P. Jantke","year":"1992","unstructured":"Klaus P. Jantke. Case based learning in inductive inference. In Proc. of the 5th ACM Workshop on Computational Learning Theory, (COLT'92), July 27\u201329, 1992, Pittsburgh, PA, USA, pages 218\u2013223. ACM Press, 1992."},{"key":"7_CR12","unstructured":"Klaus P. Jantke. Nonstandard concepts of similarity in case-based reasoning. In Bock, Lenski, and Richter, editors, 17. Jahrestagung der deutschen Gesellschaft f\u00fcr Klassifikation e.V. Kaiserslautern, (Proc. in prep.), 1993."},{"issue":"8\/9","key":"7_CR13","first-page":"465","volume":"17","author":"K. P. Jantke","year":"1981","unstructured":"Klaus P. Jantke and Hans-Rainer Beick. Combining postulates of naturalness in inductive inference. EIK, 17(8\/9):465\u2013484, 1981.","journal-title":"EIK"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Tao Jiang, Arto Salomaa, Kai Salomaa, and Sheng Yu. Inclusion is undecidable for pattern languages. In Intern. Conference Automata, Languages and Programming, ICALP'93, volume to appear of Lecture Notes in Computer Science, page ? Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56939-1_81"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF00155578","volume":"6","author":"J. L. Kolodner","year":"1992","unstructured":"Janet L. Kolodner. An introduction to case-based reasoning. Artificial Intelligence Review, 6:3\u201334, 1992.","journal-title":"Artificial Intelligence Review"},{"key":"7_CR16","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0020-0255(80)80006-5","volume":"22","author":"R. Klette","year":"1980","unstructured":"Reinhard Klette and Rolf Wiehagen. Research in the theory of inductive inference by GDR mathematicians \u2014 a survey. Information Sciences, 22:149\u2013169, 1980.","journal-title":"Information Sciences"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Steffen Lange. A note on polynomial-time inference of k-variable pattern languages. In K.P. Jantke J. Dix and P.H. Scmitt, editors, NIL'91, Non-monotonic and Inductive Logic, 1st Int. Workshop, volume 543 of Lecture Notes in Artificial Intelligence, pages 178\u2013183. Springer-Verlag, 1991.","DOI":"10.1007\/BFb0023323"},{"issue":"4","key":"7_CR18","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF03037093","volume":"8","author":"S. Lange","year":"1991","unstructured":"Steffen Lange and Rolf Wiehagen. Polynomial-time inference of arbitrary pattern languages. New Generation Computing, 8(4):361\u2013370, 1991.","journal-title":"New Generation Computing"},{"key":"7_CR19","first-page":"377","volume-title":"Types of monotonic language learning and their characterization","author":"S. Lange","year":"1992","unstructured":"Steffen Lange and Thomas Zeugmann. Types of monotonic language learning and their characterization. In Proc. of the 5th ACM Workshop on Computational Learning Theory, (COLT'92), July 27\u201329, 1992, Pittsburgh, PA, USA, pages 377\u2013390. ACM Press, 1992."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Steffen Lange and Thomas Zeugmann. Monotonic versus non-monotonic language learning. In K.P. Jantke G. Brewka and P.H. Schmitt, editors, NIL '91, Nonmonotonic and Inductive Logic, 2nd Int. Workshop, volume 659 of Lecture Notes in Artificial Intelligence, pages 254\u2013269. Springer-Verlag, 1993.","DOI":"10.1007\/BFb0030397"},{"key":"7_CR21","unstructured":"Assaf Marron. Learning pattern languages from a single initial example and from queries. In Proc. of the 1988 Workshop on Computational Learning Theory, pages 345\u2013358, 1988."},{"key":"7_CR22","unstructured":"Robert P. Nix. Editing by examples. Technical Report 280, Yale University, Dept. Comp. Sci., 1983."},{"key":"7_CR23","unstructured":"Takeshi Shinohara. Polynomial time inference of pattern languages and its applications. In 7th IBM Symposium on Mathematical Foundations of Computer Science, pages 191\u2013209, 1982."},{"key":"7_CR24","first-page":"295","volume-title":"A noise model on learning sets of strings","author":"Y. Sakakibara","year":"1992","unstructured":"Yasubumi Sakakibara and Rani Siromoney. A noise model on learning sets of strings. In Proc. of the 5th ACM Workshop on Computational Learning Theory, (COLT'92), July 27\u201329, 1992, Pittsburgh, PA, USA, pages 295\u2013302. ACM Press, 1992."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57370-4_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:12:06Z","timestamp":1605647526000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57370-4_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573708","9783540480969"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-57370-4_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}