Answering Atomic Queries in Indefinite Deductive Databases.
Saved in:
| Title: | Answering Atomic Queries in Indefinite Deductive Databases. |
|---|---|
| Authors: | Lozinskii, Eliezer L.1 |
| Source: | International Journal of Intelligent Systems. Winter89, Vol. 4 Issue 4, p403-429. 27p. |
| Subjects: | Deductive databases, Databases, Electronic information resources, Algorithms, Computer systems |
| Abstract: | Answering queries in indefinite systems is a difficult problem both computationally, since it involves non-Horn clauses and factoring, and conceptually, concerning producing beliefs for formulas not derivable from the system. To provide a basis for reasonable beliefs, we propose new criteria as an alternative to the Full Information Principle. Then an approach to producing stable beliefs, called Plausible World Assumption (PWA), is introduced. It is shown how a set of non-Horn clauses can be transformed into a set of so called singleton-head-rules such that evaluation of a given query is reduced to processing of a set of Horn clauses relevant to the query. Finally, algorithms are presented for computing facts and beliefs for atomic queries in accord with the PWA. This method is shown to be more efficient than the known techniques for query evaluation in indefinite systems. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Intelligent Systems is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 14191963 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Answering Atomic Queries in Indefinite Deductive Databases. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Lozinskii%2C+Eliezer+L%2E%22">Lozinskii, Eliezer L.</searchLink><relatesTo>1</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Intelligent+Systems%22">International Journal of Intelligent Systems</searchLink>. Winter89, Vol. 4 Issue 4, p403-429. 27p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Deductive+databases%22">Deductive databases</searchLink><br /><searchLink fieldCode="DE" term="%22Databases%22">Databases</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+information+resources%22">Electronic information resources</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+systems%22">Computer systems</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Answering queries in indefinite systems is a difficult problem both computationally, since it involves non-Horn clauses and factoring, and conceptually, concerning producing beliefs for formulas not derivable from the system. To provide a basis for reasonable beliefs, we propose new criteria as an alternative to the Full Information Principle. Then an approach to producing stable beliefs, called Plausible World Assumption (PWA), is introduced. It is shown how a set of non-Horn clauses can be transformed into a set of so called singleton-head-rules such that evaluation of a given query is reduced to processing of a set of Horn clauses relevant to the query. Finally, algorithms are presented for computing facts and beliefs for atomic queries in accord with the PWA. This method is shown to be more efficient than the known techniques for query evaluation in indefinite systems. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of International Journal of Intelligent Systems is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=14191963 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1002/int.4550040402 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 27 StartPage: 403 Subjects: – SubjectFull: Deductive databases Type: general – SubjectFull: Databases Type: general – SubjectFull: Electronic information resources Type: general – SubjectFull: Algorithms Type: general – SubjectFull: Computer systems Type: general Titles: – TitleFull: Answering Atomic Queries in Indefinite Deductive Databases. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Lozinskii, Eliezer L. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 12 Text: Winter89 Type: published Y: 1989 Identifiers: – Type: issn-print Value: 08848173 Numbering: – Type: volume Value: 4 – Type: issue Value: 4 Titles: – TitleFull: International Journal of Intelligent Systems Type: main |
| ResultId | 1 |
