Gomez, Rodolfo, Ausguto, Juan Carlos (2006) Expressiveness of Temporal Query Languages: On the Modelling of Intervals, Interval Relationships and States. Artificial Intelligence Review, 26 (4). pp. 269-289. ISSN 0269-2821. (doi:10.1007/s10462-007-9051-4) (KAR id:14531)
PDF
Language: English |
|
Download this file (PDF/157kB) |
|
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: http://dx.doi.org/10.1007/s10462-007-9051-4 |
Abstract
Storing and retrieving time-related information are important, or even critical, tasks on many areas of Computer Science (CS) and in particular for Artificial Intelligence (AI). The expressive power of temporal databases/query languages has been studied from different perspectives, but the kind of temporal information they are able to store and retrieve is not always conveniently addressed. Here we assess a number of temporal query languages with respect to the modelling of time intervals, interval relationships and states, which can be thought of as the building blocks to represent and reason about a large and important class of historic information. To survey the facilities and issues which are particular to certain temporal query languages not only gives an idea about how useful they can be in particular contexts, but also gives an interesting insight in how these issues are, in many cases, ultimately inherent to the database paradigm. While in the area of AI declarative languages are usually the preferred choice, other areas of CS heavily rely on the extended relational paradigm. This paper, then, will be concerned with the representation of historic information in two well known temporal query languages: it Templog in the context of temporal deductive databases, and it TSQL2 in the context of temporal relational databases. We hope the results highlighted here will increase cross-fertilisation between different communities. This article can be related to recent publications drawing the attention towards the different approaches followed by the Databases and AI communities when using time-related concepts.
Item Type: | Article |
---|---|
DOI/Identification number: | 10.1007/s10462-007-9051-4 |
Additional information: | Electronic version available online (http://www.springerlink.com/content/r3347p646152351m). |
Uncontrolled keywords: | temporal deductive databases; temporal relational databases; knowledge representation; temporal logic |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Mark Wheadon |
Date Deposited: | 24 Nov 2008 18:04 UTC |
Last Modified: | 05 Nov 2024 09:49 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/14531 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):