{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:24:09Z","timestamp":1761895449053},"reference-count":151,"publisher":"Elsevier","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1016\/b978-0-444-52936-7.50018-5","type":"book-chapter","created":{"date-parts":[[2012,3,28]],"date-time":"2012-03-28T01:49:27Z","timestamp":1332899367000},"page":"719-772","source":"Crossref","is-referenced-by-count":7,"title":["Mechanizing Induction"],"prefix":"10.1016","author":[{"given":"Ronald","family":"Ortner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hannes","family":"Leitgeb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0010","series-title":"The Logic of Conditionals","author":"Adams","year":"1975"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0015","series-title":"A Primer of Probability Logic","author":"Adams","year":"1998"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0020","doi-asserted-by":"crossref","first-page":"510","DOI":"10.2307\/2274239","article-title":"On the logic of theory change: Partial meet contraction and revision functions","volume":"50","author":"Alchourr\u00f3n","year":"1985","journal-title":"Journal of Symbolic Logic"},{"issue":"4","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0025","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S0895480103431071","article-title":"Learning a hidden subgraph","volume":"18","author":"Alon","year":"2005","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"4","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0030","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/j.jcss.2007.06.006","article-title":"Learning a hidden graph using O(log n) queries per edge","volume":"74","author":"Angluin","year":"2008","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0035","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/356914.356918","article-title":"Inductive inference: Theory and methods","volume":"15","author":"Angluin","year":"1983","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0040","series-title":"Proceedings of the Twenty Fourth Annual ACM Symposium on Theory of Computing (STOC), 4\u20136 May 1992","first-page":"351","article-title":"Computational learning theory: Survey and selected bibliography","author":"Angluin","year":"1992"},{"issue":"2","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0045","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.tcs.2003.11.004","article-title":"Queries revisited","volume":"313","author":"Angluin","year":"2004","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0050","first-page":"401","article-title":"Automatically categorizing written texts by author gender","volume":"17","author":"Argamon","year":"2003","journal-title":"Literary and Linguistic Computing"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0055","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10992-004-5553-6","article-title":"Conditional probability and defeasible inference","volume":"34","author":"Arl\u00f3-Costa","year":"2005","journal-title":"Journal of Philosophical Logic"},{"issue":"3","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0060","doi-asserted-by":"crossref","first-page":"233","DOI":"10.5802\/aif.938","article-title":"Densit\u00e9 et dimension. Universit\u00e9 de Grenoble","volume":"33","author":"Assouad","year":"1983","journal-title":"Annales de l'Institut Fourier"},{"issue":"2\u20133","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0065","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s10994-006-8638-3","article-title":"A new PAC bound for intersection-closed concept classes","volume":"66","author":"Auer","year":"2007","journal-title":"Machine Learning"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0070","series-title":"Machine Learning, Proceedings of the Twelfth International Conference on Machine Learning (ICML)","first-page":"21","article-title":"Theory and applications of agnostic PAC-learning with small decision trees","author":"Auer","year":"1995"},{"issue":"3","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0075","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1006\/jcss.1998.1593","article-title":"Approximating hyper-rectangles: Learning and pseudorandom sets","volume":"57","author":"Auer","year":"1998","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0080","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1006\/jcss.2001.1795","article-title":"Adaptive and self-confident on-line learning algorithms","volume":"64","author":"Auer","year":"2002","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0085","series-title":"Neural-Symbolic Cognitive Reasoning","author":"d'Avila Garcez","year":"2008"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0090","series-title":"Principles of Knowledge Representation and Reasoning","first-page":"32","article-title":"Nonmonotonic inferences in neural networks","author":"Balkenius","year":"1991"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0095","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1004650520609","article-title":"Entailment with near surety of scaled assertions of high conditional probability","volume":"29","author":"Bamber","year":"2000","journal-title":"Journal of Philosophical Logic"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0100","series-title":"Learning to learn","first-page":"71","article-title":"Theoretical models of learning to learn","author":"Baxter","year":"1998"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0105","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0004-3702(97)00012-X","article-title":"Nonmonotonic reasoning, conditional objects and possibility theory","volume":"92","author":"Benferhat","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0110","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0004-3702(00)00041-2","article-title":"Belief functions and default reasoning","volume":"122","author":"Benferhat","year":"2000","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0115","series-title":"A Philosophical Guide to Conditionals","author":"Bennett","year":"2003"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0120","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00707429","article-title":"Foundations of conditional logic","volume":"13","author":"van Benthem","year":"1984","journal-title":"Journal of Philosophical Logic"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0125","first-page":"306","article-title":"On-line algorithms in machine learning","volume":"volume 1442","author":"Blum","year":"1998"},{"issue":"6","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0130","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","article-title":"Occam's razor","volume":"24","author":"Blumer","year":"1987","journal-title":"Information Processing Letters"},{"issue":"4","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0135","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","article-title":"Learnability and the Vapnik-Chervonenkis dimension","volume":"36","author":"Blumer","year":"1989","journal-title":"Journal of the ACM"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0140","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s11229-004-1929-y","article-title":"Nonmonotonic inferences and neural networks","volume":"142","author":"Blutner","year":"2004","journal-title":"Synthese"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0145","series-title":"Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing (STOC), 14\u201316 May 1990","first-page":"54","article-title":"On the necessity of Occam algorithms","author":"Board","year":"1990"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0150","first-page":"16","article-title":"Combinatorial search on graphs motivated by bioinformatics applications: A brief survey","volume":"volume 3787","author":"Bouvel","year":"2005"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0155","series-title":"Principles of Knowledge Representation","author":"Brewka","year":"1996"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0160","series-title":"An Overview","author":"Brewka","year":"1997"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0165","series-title":"Logical Foundations of Probability","author":"Carnap","year":"1950"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0170","series-title":"Logic, Methodology and Philosophy of Science","first-page":"303","article-title":"The aim of inductive logic","author":"Carnap","year":"1962"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0175","series-title":"Prediction, Learning, and Games","author":"Cesa-Bianchi","year":"2006"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0180","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/321495.321506","article-title":"On the length of programs for computing finite binary sequences: statistical considerations","volume":"16","author":"Chaitin","year":"1969","journal-title":"Journal of the ACM"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0185","series-title":"Popper, falsification and the VC-dimension. Technical Report 145, Max Planck Institute for Biological Cybernetics","author":"Corfield","year":"2005"},{"issue":"1","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0190","doi-asserted-by":"crossref","first-page":"125","DOI":"10.2307\/3318616","article-title":"Prequential probability: principles and properties","volume":"5","author":"Dawid","year":"1999","journal-title":"Bernoulli"},{"issue":"2","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0195","doi-asserted-by":"crossref","first-page":"278","DOI":"10.2307\/2981683","article-title":"Present position and potential developments: Some personal views. Statistical theory. The prequential approach","volume":"147","author":"Dawid","year":"1984","journal-title":"Journal of the Royal Statistical Society. Series A. General"},{"issue":"390","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0200","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1080\/01621459.1985.10478118","article-title":"Comment on the impossibility of inductive inference","volume":"80","author":"Dawid","year":"1985","journal-title":"Journal of the American Statistical Association"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0205","series-title":"Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98), August 27\u201331, 1998","first-page":"37","article-title":"Occam's two razors: The sharp and the blunt","author":"Domingos","year":"1998"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0210","series-title":"\u00c9cole d'\u00c9t\u00e9 de Probabilit\u00e9s de Saint-Flour XII-1982. Lecture Notes in Mathematics 1097","article-title":"A course on empirical processes","author":"Dudley","year":"1984"},{"issue":"3","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0215","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0890-5401(89)90002-3","article-title":"A general lower bound on the number of examples needed for learning","volume":"82","author":"Ehrenfeucht","year":"1989","journal-title":"Information and Computation"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0220","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0004-3702(00)00073-4","article-title":"Default reasoning from conditional knowledge bases: Complexity and tractable cases","volume":"124","author":"Eiter","year":"2000","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0225","series-title":"Encyclopedia of Algorithms","article-title":"Hardness of proper learning","author":"Feldman","year":"2008"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0230","first-page":"155","article-title":"Logical characterizations of inductive learning","volume":"volume 4","author":"Flach","year":"2004"},{"issue":"2\u20133","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0235","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1023\/A:1007330508534","article-title":"Selective sampling using the query by committee algorithm","volume":"28","author":"Freund","year":"1997","journal-title":"Machine Learning"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0240","series-title":"An Essay on Contraction","author":"Fuhrmann","year":"1997"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0245","series-title":"Logics and Models of Concurrent Systems","first-page":"439","article-title":"Theoretical foundations for non-monotonic reasoning in expert systems","author":"Gabbay","year":"1984"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0250","volume":"Volume 3","year":"2003"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0255","series-title":"Knowledge in Flux","author":"G\u00e4rdenfors","year":"1988"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0260","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0004-3702(94)90017-5","article-title":"Nonmonotonic inference based on expectations","volume":"65","author":"G\u00e4rdenfors","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0265","series-title":"Readings in Nonmonotonic Reasoning","year":"1987"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0270","series-title":"Proceedings of the ICML-2005 Workshop on Meta-learning","first-page":"12","article-title":"Toward a justification of meta-learning: Is the no free lunch theorem a show-stopper?","author":"Giraud-Carrier","year":"2005"},{"issue":"5","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0275","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","article-title":"Language identification in the limit","volume":"10","author":"Gold","year":"1967","journal-title":"Information and Control"},{"issue":"4","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0280","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/285055.285060","article-title":"Property testing and its connection to learning and approximation","volume":"45","author":"Goldreich","year":"1998","journal-title":"Journal of the ACM"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0285","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1109\/34.204904","article-title":"A maximum entropy approach to nonmonotonic reasoning","volume":"15","author":"Goldszmidt","year":"1993","journal-title":"Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0290","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0004-3702(95)00090-9","article-title":"Qualitative probabilities for default reasoning, belief revision, and causal modeling","volume":"84","author":"Goldszmidt","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0295","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00247909","article-title":"Two modellings for theory change","volume":"17","author":"Grove","year":"1988","journal-title":"Journal of Philosophical Logic"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0300","series-title":"The Minimum Description Length Principle","author":"Gr\u00fcnwald","year":"2007"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0305","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/B:SYNT.0000004904.91112.16","article-title":"What conditional probability could not be","volume":"137","author":"H\u00e1jek","year":"2003","journal-title":"Synthese"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0310","series-title":"Proceedings of the Eighth Conference on Theoretical Aspects of Rationality and Knowledge","first-page":"17","article-title":"Lexicographic probability, conditional probability, and nonstandard probability","author":"Halpern","year":"2001"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0315","series-title":"Proceedings of the 17th International Joint Conference on AI (IJCAI 2001)","first-page":"1474","article-title":"Plausibility measures: A general approach for representing uncertainty","author":"Halpern","year":"2001"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0320","series-title":"A Textbook of Belief Dynamics","author":"Hansson","year":"1999"},{"issue":"2","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0325","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF02187876","article-title":"\u025b-nets and simplex range queries","volume":"2","author":"Haussler","year":"1987","journal-title":"Discrete & Computational Geometry"},{"issue":"2","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0330","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0890-5401(91)90042-Z","article-title":"Equivalence of models for polynomial learnability","volume":"95","author":"Haussler","year":"1991","journal-title":"Information and Computation"},{"issue":"2","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0335","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1006\/inco.1994.1097","article-title":"Predicting {0, 1}-functions on randomly drawn points","volume":"115","author":"Haussler","year":"1994","journal-title":"Information and Computation"},{"issue":"2","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0340","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0004-3702(88)90002-1","article-title":"Quantifying inductive bias: AI learning algorithms and Valiant's learning framework","volume":"36","author":"Haussler","year":"1988","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0345","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/0890-5401(92)90010-D","article-title":"Decision theoretic generalizations of the PAC model for neural net and other learning applications","volume":"100","author":"Haussler","year":"1992","journal-title":"Information and Computation"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0350","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF00247003","article-title":"On the logic of nonmonotonic conditionals and conditional probabilities","volume":"25","author":"Hawthorne","year":"1996","journal-title":"Journal of Philosophical Logic"},{"issue":"1","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0355","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1006\/jcss.1995.1011","article-title":"Robust trainability of single neurons","volume":"50","author":"H\u00f6ffgen","year":"1995","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0360","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1006\/jcss.2000.1743","article-title":"New error bounds for Solomonoff prediction","volume":"62","author":"Hutter","year":"2001","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0365","series-title":"Universal Artificial Intelligence: Sequential Decisions based on Algorithmic Probability","author":"Hutter","year":"2004"},{"issue":"1","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0370","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.tcs.2007.05.016","article-title":"On universal prediction and Bayesian confirmation","volume":"384","author":"Hutter","year":"2007","journal-title":"Theoretical Computer Science"},{"issue":"2\u20133","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0375","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00993468","article-title":"Toward efficient agnostic learning","volume":"17","author":"Kearns","year":"1994","journal-title":"Machine Learning"},{"issue":"1","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0380","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01131839","article-title":"The computable testability of theories making uncomputable predictions","volume":"43","author":"Kelly","year":"1995","journal-title":"Erkenntnis"},{"issue":"4","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0385","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1023\/B:MIND.0000045993.31233.63","article-title":"Justification as truth-finding efficiency: how Ockham's razor works","volume":"14","author":"Kelly","year":"2004","journal-title":"Minds and Machines"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0390","series-title":"Handbook of Epistemology","first-page":"183","article-title":"Learning theory and epistemology","author":"Kelly","year":"2004"},{"issue":"1\u20133","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0395","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.tcs.2003.12.013","article-title":"Uncomputability: the problem of induction internalized","volume":"317","author":"Kelly","year":"2004","journal-title":"Theoretical Computer Science"},{"issue":"vyp. 1","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0400","first-page":"3","article-title":"Three approaches to the definition of the concept \u201cquantity of information\u201d","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Problemy Pereda\u010di Informacii"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0405","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0004-3702(90)90101-5","article-title":"Nonmonotonic Reasoning, Preferential Models and Cumulative Logics","volume":"44","author":"Kraus","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0410","first-page":"274","article-title":"Is there an elegant universal theory of prediction?","volume":"volume 4264","author":"Legg","year":"2006"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0415","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(92)90041-U","article-title":"What does a conditional knowledge base entail?","volume":"55","author":"Lehmann","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0420","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF01535841","article-title":"Another perspective on default reasoning","volume":"15","author":"Lehmann","year":"1995","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0425","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0004-3702(01)00073-X","article-title":"Nonmonotonic reasoning by inhibition nets","volume":"128","author":"Leitgeb","year":"2001","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0430","series-title":"Inference on the Low Level. An Investigation into Deduction, Nonmonotonic Reasoning, and the Philosophy of Cognition","author":"Leitgeb","year":"2004"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0435","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s11229-005-9086-5","article-title":"Interpreted dynamical systems and qualitative laws: From inhibition networks to evolutionary systems","volume":"146","author":"Leitgeb","year":"2005","journal-title":"Synthese"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0440","series-title":"Proceedings of the First ILCLI International Workshop on Logic and Philosophy of Knowledge, Communication and Action, LogKCA-07","first-page":"191","article-title":"Neural network models of conditionals: An introduction","author":"Leitgeb","year":"2007"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0445","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(90)90056-6","article-title":"All I know: A study in autoepistemic logic","volume":"42","author":"Levesque","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0450","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1007\/BF00262950","article-title":"Counterfactuals and comparative possibility","volume":"2","author":"Lewis","year":"1973","journal-title":"Journal of Philosophical Logic"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0455","series-title":"Counterfactuals","author":"Lewis","year":"1973"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0460","series-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"Li","year":"1997"},{"issue":"5","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0465","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0020-0190(02)00427-1","article-title":"Sharpening Occam's razor","volume":"85","author":"Li","year":"2003","journal-title":"Information Processing Letters"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0470","series-title":"Proceedings of the 9th International Workshop on Non-Monotonic Reasoning, NMR 2002","first-page":"265","article-title":"Nonmonotonic probabilistic logics between model-theoretic probabilistic logic and probabilistic logic under coherence","author":"Lukasiewicz","year":"2002"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0475","series-title":"Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory (COLT 1994), July 12\u201315, 1994","first-page":"67","article-title":"Efficient agnostic PAC-learning with simple hypothesis","author":"Maass","year":"1994"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0480","first-page":"35","article-title":"General patterns in nonmonotonic reasoning","volume":"volume 3","author":"Makinson","year":"1994"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0485","first-page":"1","article-title":"General theory of cumulative inference","volume":"volume 346","author":"Makinson","year":"1989"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0490","volume":"volume 5","author":"Makinson","year":"2005"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0495","series-title":"Probability and Conditionals. Belief Revision and Rational Decision","first-page":"177","article-title":"Learning the impossible","author":"McGee","year":"1994"},{"issue":"6","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0500","doi-asserted-by":"crossref","first-page":"2124","DOI":"10.1109\/18.720534","article-title":"Universal prediction","volume":"44","author":"Merhav","year":"1998","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0505","series-title":"Readings in Machine Learning","article-title":"The need for biases in learning generalizations. Technical Report CBM-TR-117, Rutgers Computer Science Department, May, 1980","author":"Mitchell","year":"1990"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0510","article-title":"Machine Learning","author":"Mitchell","year":"1997","journal-title":"McGraw-Hill"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0515","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1086\/378858","article-title":"A material theory of induction","volume":"70","author":"Norton","year":"2003","journal-title":"Philosophy of Science"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0520","article-title":"Inductive Logic and Empirical Psychology","author":"Oaksford","year":"2009","journal-title":"This volume"},{"issue":"4","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0525","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.2307\/2274619","article-title":"Mechanical learners pay a price for Bayesianism","volume":"53","author":"Osherson","year":"1988","journal-title":"Journal of Symbolic Logic"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0530","article-title":"Formal Learning Theory in Context","author":"Osherson","year":"2009","journal-title":"This volume"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0535","series-title":"The Uncertain Reasoner's Companion \u2013 A Mathematical Perspective. Cambridge Tracts in Theoretical Computer Science, volume 39","author":"Paris","year":"1994"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0540","series-title":"Probabilistic Reasoning in Intelligent Systems","author":"Pearl","year":"1988"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0545","series-title":"Proceedings of the Third Conference on Theoretical Aspects of Reasoning About Knowledge","first-page":"121","article-title":"System Z: a natural ordering of defaults with tractable applications to nonmonotonic reasoning","author":"Pearl","year":"1990"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0550","series-title":". Probabilistic Foundations of Reasoning with Conditionals","first-page":"33","author":"Pearl","year":"1997"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0555","series-title":"Quantifiers in Language and Logic","author":"Peters","year":"2006"},{"issue":"4","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0560","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/48014.63140","article-title":"Computational limitations on learning from examples","volume":"35","author":"Pitt","year":"1988","journal-title":"Journal of the ACM"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0565","series-title":"Logik der Forschung","author":"Popper","year":"1969"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0570","first-page":"761","article-title":"\u2018Degree of confirmation\u2019 and inductive logic","volume":"volume 11","author":"Putnam","year":"1963"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0575","series-title":"Machine Learning, Proceedings of the Twelfth International Conference on Machine Learning (ICML 1995)","first-page":"471","article-title":"For every generalization action, is there really an equal and opposite reaction?","author":"Bharat Rao","year":"1995"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0580","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","article-title":"A logic for default reasoning","volume":"13","author":"Reiter","year":"1980","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0585","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1147\/rd.203.0198","article-title":"Generalized Kraft inequality and arithmetic coding","volume":"20","author":"Rissanen","year":"1976","journal-title":"IBM Journal of Research and Development"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0590","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","article-title":"Modelling by the shortest data description","volume":"14","author":"Rissanen","year":"1978","journal-title":"Automatica"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0595","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","article-title":"On the density of families of sets","volume":"13","author":"Sauer","year":"1972","journal-title":"Journal of Combinatorial Theory. Series A"},{"issue":"2","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0600","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF00993504","article-title":"Overfitting avoidance as bias","volume":"10","author":"Schaffer","year":"1993","journal-title":"Machine Learning"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0605","series-title":"Machine Learning, Proceedings of the Eleventh International Conference (ICML 1994)","first-page":"259","article-title":"A conservation law for generalization performance","author":"Schaffer","year":"1994"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0610","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1086\/392938","article-title":"What is \u2018normal\u2019? An evolution-theoretic foundation of normic laws and their relation to statistical normality","volume":"68","author":"Schurz","year":"2001","journal-title":"Philosophy of Science"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0615","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1023\/A:1021582327947","article-title":"Ceteris paribus laws: Classification and deconstruction","volume":"57","author":"Schurz","year":"2002","journal-title":"Erkenntnis"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0620","series-title":"Non-Monotonic and Uncertain Reasoning in the Focus of Paradigms of Cognition","year":"2005"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0625","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":". A mathematical theory of communication","volume":"27","author":"Shannon","year":"1948","journal-title":"The Bell System Technical Journal"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0630","doi-asserted-by":"crossref","first-page":"247","DOI":"10.2140\/pjm.1972.41.247","article-title":"A combinatorial problem; stability and order for models and theories in infinitary languages","volume":"41","author":"Shelah","year":"1972","journal-title":"Pacific Journal of Mathematics"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0635","series-title":"Proceedings of the Tenth International Joint Conference on Artificial Intelligence","first-page":"388","article-title":"A semantical approach to nonmonotonic logics","author":"Shoham","year":"1987"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0640","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0004-3702(99)00054-5","article-title":"Diverse confidence levels in a probabilistic semantics for conditional logics","volume":"113","author":"Snow","year":"1999","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0645","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","article-title":"A formal theory of inductive inference","volume":"7","author":"Solomonoff","year":"1964","journal-title":"I. Information and Control"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0650","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","article-title":"A formal theory of inductive inference","volume":"7","author":"Solomonoff","year":"1964","journal-title":"II. Information and Control"},{"issue":"4","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0655","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1109\/TIT.1978.1055913","article-title":"Complexity-based induction systems: comparisons and convergence theorems. Institute of Electrical and Electronics Engineers","volume":"24","author":"Solomonoff","year":"1978","journal-title":"Transactions on Information Theory"},{"issue":"1","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0660","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1006\/jcss.1997.1500","article-title":"The discovery of algorithmic probability","volume":"55","author":"Solomonoff","year":"1997","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0665","first-page":"105","article-title":"Ordinal conditional functions: A dynamic theory of epistemic states","volume":"volume 2","author":"Spohn","year":"1988"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0670","article-title":"Hempel and the Paradoxes of Confirmation","author":"Sprenger","year":"2009","journal-title":"This volume"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0675","first-page":"98","article-title":"A theory of conditionals","volume":"volume 2","author":"Stalnaker","year":"1991"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0680","series-title":"Wissenschaftliche Erkl\u00e4rung und Begr\u00fcndung","author":"Stegm\u00fcller","year":"1969"},{"issue":"11","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0685","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Communications of the ACM"},{"issue":"2","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0690","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","article-title":"On the uniform convergence of relative frequencies of events to their probabilities","volume":"16","author":"Vapnik","year":"1971","journal-title":"Theory of Probability and its Applications"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0695","series-title":"Theory of Pattern Recognition (in Russian)","author":"Vapnik","year":"1974"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0700","series-title":"The Nature of Statistical Learning Theory","author":"Vapnik","year":"1995"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0705","series-title":"Statistical Learning Theory","author":"Vapnik","year":"1998"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0710","series-title":"The Data Mining and Knowledge Discovery Handbook","first-page":"731","article-title":"Meta-learning","author":"Vilalta","year":"2005"},{"issue":"2","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0715","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1109\/18.825807","article-title":"Minimum description length induction, Bayesianism, and Kolmogorov complexity","volume":"46","author":"Vit\u00e1nyi","year":"2000","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0720","article-title":"Statistical Learning Theory: Models, Concepts, and Results","author":"von Luxburg","year":"2009","journal-title":"This volume"},{"issue":"2","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0725","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0304-3975(98)00073-5","article-title":"Non-stochastic infinite and finite sequences","volume":"207","author":"V\u2032yugin","year":"1998","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0730","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1613\/jair.228","article-title":"Further experimental evidence against the utility of Occam's razor","volume":"4","author":"Webb","year":"1996","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"3","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0735","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0012-365X(81)90274-0","article-title":"Some special VapnikChervonenkis classes","volume":"33","author":"Wenocur","year":"1981","journal-title":"Discrete Mathematics"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0740","series-title":"The mathematics of generalization","first-page":"117","article-title":"The relationship between PAC, the statistical physics framework, the Bayesian framework, and the VC framework","author":"Wolpert","year":"1995"},{"issue":"7","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0745","doi-asserted-by":"crossref","first-page":"1391","DOI":"10.1162\/neco.1996.8.7.1391","article-title":"The existence of a priori distinctions between learning algorithms","volume":"8","author":"Wolpert","year":"1996","journal-title":"Neural Computation"},{"issue":"7","key":"10.1016\/B978-0-444-52936-7.50018-5_bb0750","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1162\/neco.1996.8.7.1341","article-title":"The lack of a priori distinctions between learning algorithms","volume":"8","author":"Wolpert","year":"1996","journal-title":"Neural Computation"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0755","series-title":"Proceedings of the 6th Online World Conference on Soft Computing in Industrial Applications","article-title":"The supervised learning no-free-lunch theorems","author":"Wolpert","year":"2001"},{"key":"10.1016\/B978-0-444-52936-7.50018-5_bb0760","article-title":"Carnap and the Logic of Induction","author":"Zabell","year":"2009","journal-title":"This volume"}],"container-title":["Handbook of the History of Logic","Inductive Logic"],"original-title":[],"deposited":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T01:05:20Z","timestamp":1561511120000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780444529367500185"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"references-count":151,"URL":"https:\/\/doi.org\/10.1016\/b978-0-444-52936-7.50018-5","relation":{},"ISSN":["1874-5857"],"issn-type":[{"value":"1874-5857","type":"print"}],"subject":[],"published":{"date-parts":[[2011]]}}}