Sorted Downward Refinement: Building Background Knowledge into a Refinement Operator for Inductive Programming

Alan M. Frisch

doi:10.1007/3-540-48751-4_11

Sorted Downward Refinement: Building Background Knowledge into a Refinement Operator for Inductive Programming

Alan M. Frisch

Computer Science

Research output: Contribution to conference › Paper › peer-review

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	Undefined/Unknown
Pages	104-115
DOIs	https://doi.org/10.1007/3-540-48751-4_11
Publication status	Published - 1999

Access to Document

10.1007/3-540-48751-4_11

http://link.springer.de/link/service/series/0558/bibs/1634/16340104.htm

Cite this

@conference{5e2614c09bde4f12ab929fff7301fae4,

title = "Sorted Downward Refinement: Building Background Knowledge into a Refinement Operator for Inductive 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, {Alan M.}",

year = "1999",

doi = "10.1007/3-540-48751-4_11",

language = "Undefined/Unknown",

pages = "104--115",

}

TY - CONF

T1 - Sorted Downward Refinement

T2 - Building Background Knowledge into a Refinement Operator for Inductive Programming

AU - Frisch, Alan 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.

U2 - 10.1007/3-540-48751-4_11

DO - 10.1007/3-540-48751-4_11

M3 - Paper

SP - 104

EP - 115

ER -