Maintaining Knowledge about Temporal Intervals.
Saved in:
| Title: | Maintaining Knowledge about Temporal Intervals. |
|---|---|
| Authors: | Allen, James F.1, Waltz, David |
| Source: | Communications of the ACM. Nov83, Vol. 26 Issue 11, p832-843. 12p. 10 Diagrams. |
| Subjects: | Engineering databases, Information storage & retrieval systems, Interval analysis, Numerical analysis, ENGINE (Information retrieval system), INSPEC (Information retrieval system), Project SHARP |
| Abstract: | An interval-based temporal logic is introduced together with a computationally effective reasoning algorithm based on constraint propagation This system is notable in offering a delicate balance between expressive power and the efficiency of its deductive engine. A notion of reference intervals is introduced which captures the temporal hierarchy implicit in many domains, and which can be used to precisely control the amount of deduction performed automatically by the system. Examples we provided for a database containing historical data, a database used fur modeling processes and process interaction, and a database for an interactive system where the present moment is continually being updated. [ABSTRACT FROM AUTHOR] |
| Copyright of Communications of the ACM is the property of Association for Computing Machinery 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: 5221783 AccessLevel: 6 PubType: Periodical PubTypeId: serialPeriodical PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Maintaining Knowledge about Temporal Intervals. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Allen%2C+James+F%2E%22">Allen, James F.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Waltz%2C+David%22">Waltz, David</searchLink> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Nov83, Vol. 26 Issue 11, p832-843. 12p. 10 Diagrams. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Engineering+databases%22">Engineering databases</searchLink><br /><searchLink fieldCode="DE" term="%22Information+storage+%26+retrieval+systems%22">Information storage & retrieval systems</searchLink><br /><searchLink fieldCode="DE" term="%22Interval+analysis%22">Interval analysis</searchLink><br /><searchLink fieldCode="DE" term="%22Numerical+analysis%22">Numerical analysis</searchLink><br /><searchLink fieldCode="DE" term="%22ENGINE+%28Information+retrieval+system%29%22">ENGINE (Information retrieval system)</searchLink><br /><searchLink fieldCode="DE" term="%22INSPEC+%28Information+retrieval+system%29%22">INSPEC (Information retrieval system)</searchLink><br /><searchLink fieldCode="DE" term="%22Project+SHARP%22">Project SHARP</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: An interval-based temporal logic is introduced together with a computationally effective reasoning algorithm based on constraint propagation This system is notable in offering a delicate balance between expressive power and the efficiency of its deductive engine. A notion of reference intervals is introduced which captures the temporal hierarchy implicit in many domains, and which can be used to precisely control the amount of deduction performed automatically by the system. Examples we provided for a database containing historical data, a database used fur modeling processes and process interaction, and a database for an interactive system where the present moment is continually being updated. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Communications of the ACM is the property of Association for Computing Machinery 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=5221783 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1145/182.358434 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 12 StartPage: 832 Subjects: – SubjectFull: Engineering databases Type: general – SubjectFull: Information storage & retrieval systems Type: general – SubjectFull: Interval analysis Type: general – SubjectFull: Numerical analysis Type: general – SubjectFull: ENGINE (Information retrieval system) Type: general – SubjectFull: INSPEC (Information retrieval system) Type: general – SubjectFull: Project SHARP Type: general Titles: – TitleFull: Maintaining Knowledge about Temporal Intervals. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Allen, James F. – PersonEntity: Name: NameFull: Waltz, David IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 11 Text: Nov83 Type: published Y: 1983 Identifiers: – Type: issn-print Value: 00010782 Numbering: – Type: volume Value: 26 – Type: issue Value: 11 Titles: – TitleFull: Communications of the ACM Type: main |
| ResultId | 1 |
