Shan-Hwei Nienhuys-Cheng, Wim van Laer, Jan Ramon, Luc de Raedt  Home/Search
Context
Related
| eur.nl/WebDOC/doc/...20001116130851.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: kub.nl/~dbi/english/acquis...list (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Inductive Logic Programming considers almost exclusively universally quantied theories. To add expressiveness, prenex conjunctive normal forms (PCNF) with existential variables should also be considered. ILP mostly uses learning with refinement operators. To extend refinement operators to PCNF, we should first do so with substitutions. However, applying a classic substitution to a PCNF with existential variables, one often obtains a generalization rather than a specialization. In this article... (Update)
Similar documents (at the sentence level):
15.6%: Generalizing Refinement Operators to Learn Prenex.. - Nienhuys-Cheng.. (Correct)
Active bibliography (related documents): More All
0.5: How to Upgrade Propositional Learners to First Order Logic: .. - Van Laer, De Raedt (2001) (Correct)
0.5: Towards Learning in CARIN-ALN - Rouveirol, Ventos (2000) (Correct)
0.3: Inverse entailment and Progol - Muggleton (1995) (Correct)
Similar documents based on text: More All
1.1: Sensemaking from Actions: Deriving organization.. - van Rekom, van Riel.. (2000) (Correct)
1.1: The Effectiveness of Different Mechanisms for Integrating.. - Leenders, al. (2001) (Correct)
1.1: Learning by Experience in the Project-Based Organization - Turner, Crawford (Correct)
BibTeX entry: (Update)
@article{ nienhuyscheng99generalizing,
author = "Shan-Hwei Nienhuys-Cheng and Wim Van Laer and Jan Ramon and Luc De Raedt",
title = "Generalizing Refinement Operators to Learn Prenex Conjunctive Normal Forms",
journal = "Lecture Notes in Computer Science",
volume = "1634",
pages = "245+",
year = "1999",
url = "citeseer.ist.psu.edu/article/nienhuys-cheng00generalizing.html" }
Citations (may not include all citations):309 Symbolic Logic and Mechanical Theorem Proving (context) - Chang, Lee - 1973
95 Logic for Improving Integrity Checking in Relational Data Ba.. (context) - Nicolas - 1982
63 Inductive inference of theories from facts (context) - Shapiro
52 Learning from Good and Bad Data (context) - Laird - 1988
37 Foundations of Inductive Logic Programming (context) - Nienhuys-Cheng, de Wolf - 1997
3 Existence and nonexistence of complete refinement operators .. (context) - van der Laag, Nienhuys-Cheng - 1994
2 A new formalism to integrate quantification in inductive pro.. (context) - Goncalves, Froidevaux - 1997
2 Generalizing Refinement operators to learn Prenex Conjunctiv.. (context) - Nienhuys-Cheng, Laer et al. - 1999
2 Completeness and properness of refinement operators in induc.. (context) - van der Laag, Nienhuys-Cheng - 1998
1 Clausal discovery Machine Learning (context) - De Raedt, Dehaspe - 1997
Documents on the same site (http://www.kub.nl/~dbi/english/acquis/attent/list.htm): More
Costly Disclosures in a Voluntary Disclosure Model with an Opponent - Suijs (1999) (Correct)
Variational Inequality Problems with a Continuum of.. - Herings, Talman, Yang (1999) (Correct)
Simple and Complex Gift Exchange in the Laboratory - Van der Heijden, Nelissen.. (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC