ACM Home Page
Please provide us with feedback. Feedback
On the feasibility of checking temporal integrity constraints
Full text PdfPdf (1.00 MB)
Source Symposium on Principles of Database Systems archive
Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents
Washington, D.C., United States
Pages: 202 - 213  
Year of Publication: 1993
ISBN:0-89791-593-3
Authors
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 17,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/153850.153876
What is a DOI?

ABSTRACT

We analyze the computational feasibility of checking temporal integrity constraints formulated in some sublanguages of first-order temporal logic. Our results illustrate the impact of the quantification on the complexity of this problem. The presence of a single quantifier in the scope of a temporal operator makes the problem undecidable. On the other hand, if no quantifiers are in the scope of a temporal operator and all the quantifiers are universal, temporal integrity checking can be done in exponential time.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
3
 
4
 
5
 
6
FINGER, M., AND GABSAY, D. Adding a temporal dimension to a logic system. Journal o} Logic, Language and Information (1992).
7
 
8
 
9
 
10
 
11
12
13
14
 
15
 
16


Collaborative Colleagues:
Jan Chomicki: colleagues
Damian Niwiński: colleagues