COMPUTING FACTS IN NON-HORN DEDUCTIVE SYSTEMS

Eliezer L. Lozinskii

COMPUTING FACTS IN NON-HORN DEDUCTIVE SYSTEMS

Eliezer L. Lozinskii^*

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

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

1 Scopus citations

Abstract

Let S be a set of clauses (non-Horn as well as Horn ones), and q an atomic query. Consider the problem of deriving from S all ground unit clauses satisfying q, which we call computing all facts for q. It is shown how a non-Horn system S can be transformed into a set of singleton-head-rules, SH (S), such that computing of all facts for a given query q in S is reduced to the query evaluation in a set of Horn clauses relevant to q which is a subset of SH (S). The transformation is sound and complete.

Original language	English
Title of host publication	VLDB 1988 - Proceedings of the 14th International Conference on Very Large Data Bases
Editors	Francois Bancilhon, David J. DeWitt
Publisher	Morgan Kaufmann Publishers, Inc.
Pages	273-279
Number of pages	7
ISBN (Electronic)	0934613753, 9780934613750
State	Published - 1988
Event	14th International Conference on Very Large Data Bases, VLDB 1988 - Los Angeles, United States Duration: 29 Aug 1988 → 1 Sep 1988

Publication series

Name	VLDB 1988 - Proceedings of the 14th International Conference on Very Large Data Bases

Conference

Conference	14th International Conference on Very Large Data Bases, VLDB 1988
Country/Territory	United States
City	Los Angeles
Period	29/08/88 → 1/09/88

Bibliographical note

Publisher Copyright:
© VLDB 1987.All rights reserved.

Cite this

@inproceedings{f57ceca0fd0140e8b4eff499e84b14b7,

title = "COMPUTING FACTS IN NON-HORN DEDUCTIVE SYSTEMS",

abstract = "Let S be a set of clauses (non-Horn as well as Horn ones), and q an atomic query. Consider the problem of deriving from S all ground unit clauses satisfying q, which we call computing all facts for q. It is shown how a non-Horn system S can be transformed into a set of singleton-head-rules, SH (S), such that computing of all facts for a given query q in S is reduced to the query evaluation in a set of Horn clauses relevant to q which is a subset of SH (S). The transformation is sound and complete.",

author = "Lozinskii, \{Eliezer L.\}",

year = "1988",

language = "אנגלית",

series = "VLDB 1988 - Proceedings of the 14th International Conference on Very Large Data Bases",

publisher = "Morgan Kaufmann Publishers, Inc.",

pages = "273--279",

editor = "Francois Bancilhon and DeWitt, \{David J.\}",

booktitle = "VLDB 1988 - Proceedings of the 14th International Conference on Very Large Data Bases",

address = "ארצות הברית",

}

Lozinskii, EL 1988, COMPUTING FACTS IN NON-HORN DEDUCTIVE SYSTEMS. in F Bancilhon & DJ DeWitt (eds), VLDB 1988 - Proceedings of the 14th International Conference on Very Large Data Bases. VLDB 1988 - Proceedings of the 14th International Conference on Very Large Data Bases, Morgan Kaufmann Publishers, Inc., pp. 273-279, 14th International Conference on Very Large Data Bases, VLDB 1988, Los Angeles, United States, 29/08/88.

COMPUTING FACTS IN NON-HORN DEDUCTIVE SYSTEMS. / Lozinskii, Eliezer L.
VLDB 1988 - Proceedings of the 14th International Conference on Very Large Data Bases. ed. / Francois Bancilhon; David J. DeWitt. Morgan Kaufmann Publishers, Inc., 1988. p. 273-279 (VLDB 1988 - Proceedings of the 14th International Conference on Very Large Data Bases).

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

TY - GEN

T1 - COMPUTING FACTS IN NON-HORN DEDUCTIVE SYSTEMS

AU - Lozinskii, Eliezer L.

PY - 1988

Y1 - 1988

N2 - Let S be a set of clauses (non-Horn as well as Horn ones), and q an atomic query. Consider the problem of deriving from S all ground unit clauses satisfying q, which we call computing all facts for q. It is shown how a non-Horn system S can be transformed into a set of singleton-head-rules, SH (S), such that computing of all facts for a given query q in S is reduced to the query evaluation in a set of Horn clauses relevant to q which is a subset of SH (S). The transformation is sound and complete.

AB - Let S be a set of clauses (non-Horn as well as Horn ones), and q an atomic query. Consider the problem of deriving from S all ground unit clauses satisfying q, which we call computing all facts for q. It is shown how a non-Horn system S can be transformed into a set of singleton-head-rules, SH (S), such that computing of all facts for a given query q in S is reduced to the query evaluation in a set of Horn clauses relevant to q which is a subset of SH (S). The transformation is sound and complete.

UR - https://www.scopus.com/pages/publications/105029766975

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:105029766975

T3 - VLDB 1988 - Proceedings of the 14th International Conference on Very Large Data Bases

SP - 273

EP - 279

BT - VLDB 1988 - Proceedings of the 14th International Conference on Very Large Data Bases

A2 - Bancilhon, Francois

A2 - DeWitt, David J.

PB - Morgan Kaufmann Publishers, Inc.

T2 - 14th International Conference on Very Large Data Bases, VLDB 1988

Y2 - 29 August 1988 through 1 September 1988

ER -

COMPUTING FACTS IN NON-HORN DEDUCTIVE SYSTEMS

Abstract

Publication series

Conference

Bibliographical note

Other files and links

Fingerprint

Cite this