Opening book details…
Can I read On the Feasibility of Checking Temporal Integrity Constraints on EtoBox?
On the Feasibility of Checking Temporal Integrity Constraints by J. Chomicki; D. Niwinski is a Computer Science article available to read on EtoBox.
What is On the Feasibility of Checking Temporal Integrity Constraints about?
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 quantifier pattern 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. c. 1995 Academic Press, Inc.
Who reads On the Feasibility of Checking Temporal Integrity Constraints?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- J. Chomicki; D. Niwinski
- Publisher
- Elsevier Science; Elsevier ; Elsevier Inc.; Elsevier BV (ISSN 0022-0000)
- Published
- 1995
- Language
- EN
- Field
- Computer Science (Physical Sciences)