Skip navigation
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKuper, Gabriel M.-
dc.contributor.authorTuzhilin, Alex-
dc.date.accessioned2006-02-08T14:51:53Z-
dc.date.available2006-02-08T14:51:53Z-
dc.date.issued1992-04-
dc.identifier.urihttp://hdl.handle.net/2451/14332-
dc.description.abstractWe 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.extent3131591 bytes-
dc.format.mimetypeapplication/pdf-
dc.languageEnglishEN
dc.language.isoen_US-
dc.publisherStern School of Business, New York Universityen
dc.relation.ispartofseriesIS-92-16-
dc.titleON THE EXPRESSIVE POWER OF INFINITE TEMPORAL DATABASESen
dc.typeWorking Paperen
dc.description.seriesInformation Systems Working Papers SeriesEN
Appears in Collections:IOMS: Information Systems Working Papers

Files in This Item:
File Description SizeFormat 
IS-92-16.pdf3.06 MBAdobe PDFView/Open


Items in FDA are protected by copyright, with all rights reserved, unless otherwise indicated.