Every reference with a DOI in the deposited reference list resolved to a known
work in Crossref or DataCite at the dated check, and none carried a retraction,
withdrawal, or removal notice.
The 16 checked references that resolve
resolves10.1145/210197.210200Efficient checking of temporal integrity constraints using bounded history encoding
resolves10.1007/BF01893887Theoretical foundations of handling large substitution sets in temporal integrity monitoring
resolves10.1007/BFb0026308Using finite-linear temporal logic for specifying database dynamics
The 6 references without a DOI — listed, not checked
no DOI — not checkedAbiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)
no DOI — not checkedArtale, A., Kontchakov, R., Ryzhikov, V., Zakharyaschev, M.: Temporal conceptual modelling with DL-Lite. In: Proc. of the 2010 Int. Workshop on Description Logics (DL 2010). CEUR Workshop Proceedings, vol. 573. CEUR-WS.org (2010)
no DOI — not checkedArtale, A., Kontchakov, R., Ryzhikov, V., Zakharyaschev, M.: A cookbook for temporal conceptual data modelling with description logics. CoRR abs/1209.5571 (2012), http://arxiv.org/abs/1209.5571
no DOI — not checkedArtale, A., Kontchakov, R., Wolter, F., Zakharyaschev, M.: Temporal description logic for ontology-based data access. In: Proc. of the 23rd Int. Joint Conf. on Artificial Intelligence (IJCAI 2013). AAAI Press (2013)
no DOI — not checkedCalvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: DL-Lite: Tractable description logics for ontologies. In: Proc. of the 20th Nat. Conf. on Artificial Intelligence (AAAI 2005), pp. 602–607. AAAI Press (2005)
no DOI — not checkedLaroussinie, F., Markey, N., Schnoebelen, P.: Temporal logic with forgettable past. In: Proc. of the 17th Annual IEEE Symp. on Logic in Computer Science (LICS 2002), pp. 383–392. IEEE Press (2002)
checked 2026-07-26 — re-checked daily as this page is visited;
titles and statuses come from Crossref and DataCite and are not part of the signed record
Both snippets point at the live badge image and link back to this page. The
badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.