@inproceedings{38e08fad7a74408ab98600d2e54104ed,
title = "On the feasibility of checking temporal integrity constraints",
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 make 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.",
author = "Jan Chomicki and Damian Niwinski",
year = "1993",
doi = "10.1145/153850.153876",
language = "English",
isbn = "0897915933",
series = "Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems",
publisher = "Publ by ACM",
pages = "202--213",
booktitle = "Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems",
note = "Proceedings of the 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems ; Conference date: 25-05-1993 Through 28-05-1993",
}