Accession Number | 003047614
|
Author | Ioannidis YE. Wong E.
|
Institution | Dept. of Elect. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA.
|
Editor | Kerschberg L.
|
Title | An algebraic approach to recursive inference.
|
Source | Proceedings from the First International Conference on Expert Database Systems. Benjamin/Cummings. 1987, pp.295-309. Menlo Park, CA, USA.
|
Date of Publication | 1987
|
Country of Publication | USA.
|
Conference Information | Charleston, SC, USA. Univ. South Carolina. 1-4 April 1986.
|
Abstract | Recursion in the database context has traditionally been studied under the formalism of 1-st order logic. In particular, the bulk of the research effort in the last few years has been devoted to recursive Horn clauses. The authors reformulate the recursion problem in operator form. The relational operators are embedded in a partially ordered semiring with identity. This algebraic structure so obtained enables them to get more information about the mechanics of recursion. One of this is that they have been able to obtain a significant decomposition theorem for recursive queries. (4 References).
|
Abstract Number | C88008582
|
Subject Headings | Database theory. Formal logic. Knowledge engineering. Relational databases.
|
Key Phrase Identifiers | recursive inference; database; 1-st order logic; recursive Horn clauses; relational operators; partially ordered semiring; decomposition theorem; recursive queries.
|
Classification Codes | Artificial intelligence [C1230]; Database theory [C4250]; Relational databases [C6160D]; Expert systems and other AI software and techniques [C6170].
|
Treatment | Theoretical or mathematical.
|
Language | English.
|
ISBN | 0 8053 3271 5.
|
Publication Type | Conference Paper.
|
Update Code | 198800.
|