Induction as a search procedure

• Autor(es): Stasinos Konstantopoulos ; Rui Camacho ; Nuno A. Foseca ; Vítor Santos Costa
• Data: 2008
• Identificador Persistente: http://hdl.handle.net/10216/67123
• Origem: Repositório Aberto da Universidade do Porto
• Assunto(s): Ciências Tecnológicas; Tecnologia; Tecnologia de computadores
• Tipo de Documento: Parte ou capítulo de livro
• Idioma: Inglês

Descrição

This chapter introduces Inductive Logic Programming (ILP) from the perspective of search algorithms in Computer Science. It first briefly considers the Version Spaces approach to induction, and then focuses on Inductive Logic Programming: from its formal definition and main techniques and strategies, to priors used to restrict the search space and optimized sequential, parallel, and stochastic algorithms. The authors hope that this presentation of the theory and applications of Inductive Logic Programming will help the reader understand the theoretical underpinnings of ILP, and also provide a helpful overview of the State-of-the-Art in the domain.