Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > A framework for set-oriented computation in inductive logic programming and its application in generalizing inverse entailment
Publication

Publications

A framework for set-oriented computation in inductive logic programming and its application in generalizing inverse entailment

Title
A framework for set-oriented computation in inductive logic programming and its application in generalizing inverse entailment
Type
Article in International Conference Proceedings Book
Year
2005
Authors
Bravo, HC
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Page, D
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Ramakrishnan, R
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Shavlik, J
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Costa, VS
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Conference proceedings International
Pages: 69-86
15th International Conference on Inductive Logic Programming, ILP 2005
Bonn, 10 August 2005 through 13 August 2005
Indexing
Other information
Authenticus ID: P-007-E90
Abstract (EN): We propose a new approach to Inductive Logic Programming i that systematically exploits caching and offers a number of advantages over current systems. It avoids redundant computation, is more amenable to the use of set-oriented generation and evaluation of hypotheses, and allows relational DBMS technology to be more easily applied to ILP systems. Further, our approach opens up new avenues such as probabilistically scoring rules during search and the generation of probabilistic rules. As a first example of the benefits of our ILP framework, we propose a scheme for denning the hypothesis search space through Inverse Entailment using multiple example seeds. © Springer-Verlag Berlin Heidelberg 2005.
Language: English
Type (Professor's evaluation): Scientific
Documents
We could not find any documents associated to the publication.
Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-08-08 at 16:33:57 | Privacy Policy | Personal Data Protection Policy | Whistleblowing