Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classification

12/12/2002
by   Peter D. Turney, et al.
0

The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a challenge was issued "to the international computing community" to discover low size-complexity Prolog programs for classifying trains. The challenge was based on a problem first proposed by Ryszard Michalski, 20 years ago. We interpreted the challenge as a problem in cost-sensitive classification and we applied a recently developed cost-sensitive classifier to the competition. Our algorithm was relatively successful (we won a prize). This paper presents our algorithm and analyzes the results of the competition.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/21/2017

The Design and Implementation of Modern Online Programming Competitions

This paper presents a framework for the implementation of online program...
06/10/2002

The Prioritized Inductive Logic Programs

The limit behavior of inductive logic programs has not been explored, bu...
05/17/2020

Quantifying the Impact on Software Complexity of Composable Inductive Programming using Zoea

Composable inductive programming as implemented in the Zoea programming ...
07/10/2017

Best-Effort Inductive Logic Programming via Fine-grained Cost-based Hypothesis Generation

We describe the Inspire system which participated in the first competiti...
11/13/2019

Zoea – Composable Inductive Programming Without Limits

Automatic generation of software from some form of specification has bee...
12/11/2002

Types of Cost in Inductive Concept Learning

Inductive concept learning is the task of learning to assign cases to a ...
05/27/2011

The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference

It is common to view programs as a combination of logic and control: the...