Building Theories into Instantiation

Alan M. Frisch; C. David  Page Jr.

Building Theories into Instantiation

Computer Science

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

Abstract

Instantiation orderings over formulas (the relation of one formula being an instance of another) have long been central to the study of automated deduction and logic programming, and are of rapidly-growing importance in the study of database systems and machine learning. A variety of instantiation orderings are now in use, many of which incorporate some kind of background information in the form of a constraint theory. Even a casual examination of these instantiation orderings reveals that they are somehow related, but in exactly what way? This paper presents a general instantiation ordering of which all these orderings are special cases, as are other instantiation orderings. The paper shows that this general ordering has the semantic properties we desire in an instantiation ordering, implying that the special cases have these properties as well. The extension to this general ordering is useful
in applications to inductive logic programming,
automated deduction and logic programming,
knowledge-base vivification, and database systems

Original language	Undefined/Unknown
Pages	1210-1216
Publication status	Published - 1995

Access to Document

http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.1610

Cite this

@conference{d296f644161a4c69a46bb3cffaecf0d4,

title = "Building Theories into Instantiation",

abstract = "Instantiation orderings over formulas (the relation of one formula being an instance of another) have long been central to the study of automated deduction and logic programming, and are of rapidly-growing importance in the study of database systems and machine learning. A variety of instantiation orderings are now in use, many of which incorporate some kind of background information in the form of a constraint theory. Even a casual examination of these instantiation orderings reveals that they are somehow related, but in exactly what way? This paper presents a general instantiation ordering of which all these orderings are special cases, as are other instantiation orderings. The paper shows that this general ordering has the semantic properties we desire in an instantiation ordering, implying that the special cases have these properties as well. The extension to this general ordering is usefulin applications to inductive logic programming,automated deduction and logic programming,knowledge-base vivification, and database systems",

author = "Frisch, {Alan M.} and {Page Jr.}, {C. David}",

year = "1995",

language = "Undefined/Unknown",

pages = "1210--1216",

}

TY - CONF

T1 - Building Theories into Instantiation

AU - Frisch, Alan M.

AU - Page Jr., C. David

PY - 1995

Y1 - 1995

N2 - Instantiation orderings over formulas (the relation of one formula being an instance of another) have long been central to the study of automated deduction and logic programming, and are of rapidly-growing importance in the study of database systems and machine learning. A variety of instantiation orderings are now in use, many of which incorporate some kind of background information in the form of a constraint theory. Even a casual examination of these instantiation orderings reveals that they are somehow related, but in exactly what way? This paper presents a general instantiation ordering of which all these orderings are special cases, as are other instantiation orderings. The paper shows that this general ordering has the semantic properties we desire in an instantiation ordering, implying that the special cases have these properties as well. The extension to this general ordering is usefulin applications to inductive logic programming,automated deduction and logic programming,knowledge-base vivification, and database systems

AB - Instantiation orderings over formulas (the relation of one formula being an instance of another) have long been central to the study of automated deduction and logic programming, and are of rapidly-growing importance in the study of database systems and machine learning. A variety of instantiation orderings are now in use, many of which incorporate some kind of background information in the form of a constraint theory. Even a casual examination of these instantiation orderings reveals that they are somehow related, but in exactly what way? This paper presents a general instantiation ordering of which all these orderings are special cases, as are other instantiation orderings. The paper shows that this general ordering has the semantic properties we desire in an instantiation ordering, implying that the special cases have these properties as well. The extension to this general ordering is usefulin applications to inductive logic programming,automated deduction and logic programming,knowledge-base vivification, and database systems

M3 - Paper

SP - 1210

EP - 1216

ER -