This book is concerned with the rich and fruitful interplay between the fields of computational logic and machine learning. The intended audience is senior undergraduates, graduate students, and researchers in either of those fields. For those in computational logic, no previous knowledge of machine learning is assumed and, for those in machine learning, no previous knowledge of computational logic is assumed. The logic used throughout the book is a higher-order one. Higher-order logic is already heavily used in some parts of computer science, for example, theoretical computer science, functional programming, and hardware verifica tion, mainly because of its great expressive power. Similar motivations apply here as well: higher-order functions can have other functions as arguments and this capability can be exploited to provide abstractions for knowledge representation, methods for constructing predicates, and a foundation for logic-based computation. The book should be of interest to researchers in machine learning, espe cially those who study learning methods for structured data. Machine learn ing applications are becoming increasingly concerned with applications for which the individuals that are the subject of learning have complex struc ture. Typical applications include text learning for the World Wide Web and bioinformatics. Traditional methods for such applications usually involve the extraction of features to reduce the problem to one of attribute-value learning.Circle, Triangle, Square : Shape Class 1, Class 2 : Class. In this illustration, there is no information on the edges of the graph, so the type 1 is used as a default for the type of this information and the empty tuple () is used for all these values.
|Title||:||Logic for Learning|
|Author||:||John W. Lloyd|
|Publisher||:||Springer Science & Business Media - 2003-08-06|