Sorted downward refinement: Building background knowledge into a refinement operator for inductive logic programming

A M Frisch

Sorted downward refinement: Building background knowledge into a refinement operator for inductive logic programming

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Since its inception, the field of inductive logic programming has been centrally concerned with the use of background knowledge in induction. Yet, surprisingly, no serious attempts have been made to account for background knowledge in refinement operators for clauses, even though such operators are one of the most important, prominent and widely-used devices in the field. This paper shows how a sort theory, which encodes taxonomic knowledge, can be built into a downward, subsumption-based refinement operator for clauses.

Original language	English
Title of host publication	INDUCTIVE LOGIC PROGRAMMING
Editors	S Dzeroski, P Flach
Place of Publication	BERLIN
Publisher	Springer
Pages	104-115
Number of pages	12
ISBN (Print)	3-540-66109-3
Publication status	Published - 1999
Event	9th International Workshop on Inductive Logic Programming (ILP-99) - BLED Duration: 24 Jun 1999 → 27 Jun 1999

Conference

Conference	9th International Workshop on Inductive Logic Programming (ILP-99)
City	BLED
Period	24/06/99 → 27/06/99

Cite this

@inproceedings{6941b1f834e5413381f0fee879b60c60,

title = "Sorted downward refinement: Building background knowledge into a refinement operator for inductive logic programming",

abstract = "Since its inception, the field of inductive logic programming has been centrally concerned with the use of background knowledge in induction. Yet, surprisingly, no serious attempts have been made to account for background knowledge in refinement operators for clauses, even though such operators are one of the most important, prominent and widely-used devices in the field. This paper shows how a sort theory, which encodes taxonomic knowledge, can be built into a downward, subsumption-based refinement operator for clauses.",

author = "Frisch, {A M}",

year = "1999",

language = "English",

isbn = "3-540-66109-3",

pages = "104--115",

editor = "S Dzeroski and P Flach",

booktitle = "INDUCTIVE LOGIC PROGRAMMING",

publisher = "Springer",

address = "Germany",

note = "9th International Workshop on Inductive Logic Programming (ILP-99) ; Conference date: 24-06-1999 Through 27-06-1999",

}

TY - GEN

T1 - Sorted downward refinement: Building background knowledge into a refinement operator for inductive logic programming

AU - Frisch, A M

PY - 1999

Y1 - 1999

N2 - Since its inception, the field of inductive logic programming has been centrally concerned with the use of background knowledge in induction. Yet, surprisingly, no serious attempts have been made to account for background knowledge in refinement operators for clauses, even though such operators are one of the most important, prominent and widely-used devices in the field. This paper shows how a sort theory, which encodes taxonomic knowledge, can be built into a downward, subsumption-based refinement operator for clauses.

AB - Since its inception, the field of inductive logic programming has been centrally concerned with the use of background knowledge in induction. Yet, surprisingly, no serious attempts have been made to account for background knowledge in refinement operators for clauses, even though such operators are one of the most important, prominent and widely-used devices in the field. This paper shows how a sort theory, which encodes taxonomic knowledge, can be built into a downward, subsumption-based refinement operator for clauses.

M3 - Conference contribution

SN - 3-540-66109-3

SP - 104

EP - 115

BT - INDUCTIVE LOGIC PROGRAMMING

A2 - Dzeroski, S

A2 - Flach, P

PB - Springer

CY - BERLIN

T2 - 9th International Workshop on Inductive Logic Programming (ILP-99)

Y2 - 24 June 1999 through 27 June 1999

ER -