This is both a work-immanent analysis of Lun dao, and an introduction to Jin’s thought. It begins with the problem of induction, which is the study’s central theme, and proceeds to outline Jin’s ontological response. In addition, it also considers his epistemological response to the problem.

Ontology was once understood to be the philosophical inquiry into the structure of reality: the analysis and categorization of ‘what there is’. Recently, however, a field called ‘ontology’ has become part of the rapidly growing research industry in information technology. The two fields have more in common than just their name. Theory and Applications of Ontology is a two-volume anthology that aims to further an informed discussion about the relationship between ontology in philosophy and ontology in information technology. It fills an important lacuna in cutting-edge research on ontology in both fields, supplying stage-setting overview articles on history and method, presenting directions of current research in either field, and highlighting areas of productive interdisciplinary contact. Theory and Applications of Ontology: Philosophical Perspectives presents ontology in philosophy in ways that computer scientists are not likely to find elsewhere. The volume offers an overview of current research traditions in ontology, contrasting analytical, phenomenological, and hermeneutic approaches. It introduces the reader to current philosophical research on those categories of everyday and scientific reasoning that are most relevant to present and future research in information technology.

The implications for philosophy and cognitive science of developments in statistical learning theory. In Reliable Reasoning, Gilbert Harman and Sanjeev Kulkarni—a philosopher and an engineer—argue that philosophy and cognitive science can benefit from statistical learning theory (SLT), the theory that lies behind recent advances in machine learning. The philosophical problem of induction, for example, is in part about the reliability of inductive reasoning, where the reliability of a method is measured by its statistically expected percentage of errors—a central topic in SLT. After discussing philosophical attempts to evade the problem of induction, Harman and Kulkarni provide an admirably clear account of the basic framework of SLT and its implications for inductive reasoning. They explain the Vapnik-Chervonenkis (VC) dimension of a set of hypotheses and distinguish two kinds of inductive reasoning. The authors discuss various topics in machine learning, including nearest-neighbor methods, neural networks, and support vector machines. Finally, they describe transductive reasoning and suggest possible new models of human reasoning suggested by developments in SLT.

A Logical Introduction to Probability and Induction is a textbook on the mathematics of the probability calculus and its applications in philosophy. On the mathematical side, the textbook introduces these parts of logic and set theory that are needed for a precise formulation of the probability calculus. On the philosophical side, the main focus is on the problem of induction and its reception in epistemology and the philosophy of science. Particular emphasis is placed on the means-end approach to the justification of inductive inference rules. In addition, the book discusses the major interpretations of probability. These are philosophical accounts of the nature of probability that interpret the mathematical structure of the probability calculus. Besides the classical and logical interpretation, they include the interpretation of probability as chance, degree of belief, and relative frequency. The Bayesian interpretation of probability as degree of belief locates probability in a subject's mind. It raises the question why her degrees of belief ought to obey the probability calculus. In contrast to this, chance and relative frequency belong to the external world. While chance is postulated by theory, relative frequencies can be observed empirically. A Logical Introduction to Probability and Induction aims to equip students with the ability to successfully carry out arguments. It begins with elementary deductive logic and uses it as basis for the material on probability and induction. Throughout the textbook results are carefully proved using the inference rules introduced at the beginning, and students are asked to solve problems in the form of 50 exercises. An instructor's manual contains the solutions to these exercises as well as suggested exam questions. The book does not presuppose any background in mathematics, although sections 10.3-10.9 on statistics are technically sophisticated and optional. The textbook is suitable for lower level undergraduate courses in philosophy and logic.

Perspectives on Ontology Learning brings together researchers and practitioners from different communities − natural language processing, machine learning, and the semantic web − in order to give an interdisciplinary overview of recent advances in ontology learning. Starting with a comprehensive introduction to the theoretical foundations of ontology learning methods, the edited volume presents the state-of-the-start in automated knowledge acquisition and maintenance. It outlines future challenges in this area with a special focus on technologies suitable for pushing the boundaries beyond the creation of simple taxonomical structures, as well as on problems specifically related to knowledge modeling and representation using the Web Ontology Language. Perspectives on Ontology Learning is designed for researchers in the field of semantic technologies and developers of knowledge-based applications. It covers various aspects of ontology learning including ontology quality, user interaction, scalability, knowledge acquisition from heterogeneous sources, as well as the integration with ontology engineering methodologies.

This book constitutes the refereed proceedings of the 18th International Conference on Inductive Logic Programming, ILP 2008, held in Prague, Czech Republic, in September 2008. The 20 revised full papers presented together with the abstracts of 5 invited lectures were carefully reviewed and selected during two rounds of reviewing and improvement from 46 initial submissions. All current topics in inductive logic programming are covered, ranging from theoretical and methodological issues to advanced applications. The papers present original results in the first-order logic representation framework, explore novel logic induction frameworks, and address also new areas such as statistical relational learning, graph mining, or the semantic Web.