Normal Forms for Inductive Logic Programming
@inproceedings{Flach1997NormalFF,
title={Normal Forms for Inductive Logic Programming},
author={Peter A. Flach},
booktitle={ILP},
year={1997}
}In this paper we study induction of unrestricted clausal theories from interpretations. First, we show that in the propositional case induction from complete evidence can be seen as an equivalence-preserving transformation from DNF to CNF. From this we conclude that induction is essentially a process of determining what is false in the domain of discourse. We then proceed by investigating dual normal forms for evidence and hypotheses in predicate logic. We define evidence nonnal form (ENF…
9 Citations
Learning in Clausal Logic: A Perspective on Inductive Logic Programming
- Computer ScienceComputational Logic: Logic Programming and Beyond
- 2002
The chapter outlines the main current research directions which have been strongly influenced by recent developments in data mining and challenging real-life applications, and gives an accessible introduction to the above topics.
From Extensional to Intensional Knowledge: Inductive Logic Programming Techniques and Their Application to Deductive Databases
- Computer ScienceTransactions and Change in Logic Databases
- 1998
This chapter aims at demonstrating that inductive logic programming (ILP), a recently established subfield of machine learning that induces first-order clausal theories from examples, combines very…
Clausal Discovery
- BusinessMachine Learning
- 2004
CLAUDIEN is an inductive logic programming engine that fits in the descriptive data mining paradigm and employs a novel declarative bias mechanism to define the set of clauses that may appear in a hypothesis.
Database Dependency Discovery: A Machine Learning Approach
- Computer ScienceAI Commun.
- 1999
The algorithms in this paper are designed such that they can easily be generalised to other kinds of dependencies, and the bottom-up algorithm is the most efficient of the three, and also outperforms other algorithms from the literature.
The logic of learning: a brief introduction to Inductive Logic Programming
- Computer Science
- 1998
The aim of concept learning is to discover, from a given set of pre-classified examples, a set of classification rules with high predictive power, so-called attribute-value languages have sufficient representational power.
Learning Rule Sets
- Computer Science
- 2012
This chapter presents approaches that construct sets of rules that can be constructed by iterative usage of the algorithms for constructing single rules presented in Chap.
Cooking up integrity constraints with PRIMUS (preliminary report)
- Psychology
- 1997
In this report we describe the main ideas underlying PRIMUS, a system for discovery of first-order integrity constraints guided by heuristics, currently under development.
Reinventing Machine Learning with ROC Analysis
- Computer ScienceIBERAMIA-SBIA
- 2006
Receiver Operating Characteristics is used in medical data analysis to study the effect of varying the threshold on the numerical outcome of a diagnostic test and in response to classification tasks with skewed class distributions or misclassification costs.
References
SHOWING 1-10 OF 11 REFERENCES
Inductive Constraint Logic
- Computer ScienceALT
- 1995
A novel approach to learning first order logic formulae from positive and negative examples is presented, which corresponds to a conjuctive normal form where each conjunct forms a constraint on positive examples.
Induction in logic
- Computer Science
- 1996
An attempt is made to build a unifying framework for the logical aspects of inductive machine learning and data mining, and allows to give in logical terms precise definitions of what is meant by deduction, induction, generalization, specialization, and their relations.
Exact learning via the Monotone theory
- Computer ScienceProceedings of 1993 IEEE 34th Annual Foundations of Computer Science
- 1993
The Monotone theory is developed that proves any boolean function is learnable as decision tree or as DNF or as CNF, and the first result solves the open problem of the learnability of decision trees.
The CN 2 induction algorithm
- Machine Learning
- 1989
Van Laer . Inductive Constraint Logic
- Proc . 6 th Workshop on Algorithmic Learning Theory
- 1995