Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kuper, Gabriel M. | - |
dc.contributor.author | Tuzhilin, Alex | - |
dc.date.accessioned | 2006-02-08T14:51:53Z | - |
dc.date.available | 2006-02-08T14:51:53Z | - |
dc.date.issued | 1992-04 | - |
dc.identifier.uri | http://hdl.handle.net/2451/14332 | - |
dc.description.abstract | We discuss different techniques for representing infinite temporal data. There are two basic approaches: A procedural description, as used in production systems, and represented, in this paper, by a version of Datalog. The second approach is a more declarative method, using some form of temporal logic programming. We examine several versions of each approach, and compare their expressive power, i.e., what temporal data each formalism can capture. | en |
dc.format.extent | 3131591 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language | English | EN |
dc.language.iso | en_US | - |
dc.publisher | Stern School of Business, New York University | en |
dc.relation.ispartofseries | IS-92-16 | - |
dc.title | ON THE EXPRESSIVE POWER OF INFINITE TEMPORAL DATABASES | en |
dc.type | Working Paper | en |
dc.description.series | Information Systems Working Papers Series | EN |
Appears in Collections: | IOMS: Information Systems Working Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
IS-92-16.pdf | 3.06 MB | Adobe PDF | View/Open |
Items in FDA are protected by copyright, with all rights reserved, unless otherwise indicated.