On the Feasibility of Checking Temporal Integrity Constraints
Summary: Analyzes feasibility of checking temporal integrity constraints in first-order temporal logic fragments, focusing on where quantifiers occur relative to temporal operators. Key findings: a single quantifier under a temporal operator causes undecidability; if no quantifiers lie inside temporal scope and all quantifiers are universal, checking is EXPTIME decidable. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jan Chomicki
- 2. Damian Niwiński
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,931 | Foundations of Data-Aware Process Analysis: A Database Theory Perspective | 2013 | PODS | 0.0001005178 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 685 | Event Specification in an Active Object-Oriented Database | 1992 | SIGMOD | 0.00018133437 |
| 834 | A Temporal Framework for Database Specifications | 1982 | VLDB | 0.00016083127 |
| 6,150 | Real-Time Integrity Constraints (extended abstract) | 1992 | PODS | 5.1805777e-05 |
| 6,824 | A Transaction Logic for Database Specification | 1988 | SIGMOD | 4.9096742e-05 |
Previous
Page 1 / 1
Next