On the feasibility of checking temporal integrity constraints

DOI10.1006/jcss.1995.1088zbMath0839.68094OpenAlexW2033709993MaRDI QIDQ1908342

Jan Chomicki, Damian Niwinski

Publication date: 10 June 1996

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ebc1b5fb68faa30eccbded1c810b087a782f7e63

zbMATH Keywords

temporal logiccomputational feasibilitytemporal integrity constraints

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (8)

Undecidability of QLTL and QCTL with two variables and one monadic predicate letter ⋮ First-order temporal verification in practice ⋮ A first step towards implementing dynamic algebraic dependences ⋮ The ins and outs of first-order runtime verification ⋮ Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting ⋮ Monitoring Metric First-Order Temporal Properties ⋮ Axiomatizing the monodic fragment of first-order temporal logic ⋮ Decidable fragments of first-order temporal logics

This page was built for publication: On the feasibility of checking temporal integrity constraints