Please use this identifier to cite or link to this item:
Author(s): Konstantopoulos, S
Rui Camacho
Fonseca, NA
Costa, VS
Title: Induction as a search procedure
Issue Date: 2008
Abstract: 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. (c) 2008, IGI Global.
Subject: Tecnologia de computadores
Computer technology
Source: Artificial Intelligence for Advanced Problem Solving Techniques
Document Type: Capítulo ou Parte de Livro
Rights: openAccess
Appears in Collections:FCUP - Capítulo ou Parte de Livro
FEUP - Capítulo ou Parte de Livro

Files in This Item:
File Description SizeFormat 
70444.pdfInduction as a search procedure654.8 kBAdobe PDFThumbnail

This item is licensed under a Creative Commons License Creative Commons