On the feasibility of checking temporal integrity constraints

DOI10.1006/JCSS.1995.1088zbMATH Open0839.68094OpenAlexW2033709993MaRDI QIDQ1908342FDOQ1908342

Damian Niwiński, Jan Chomicki

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)

Cited In (9)

• A first step towards implementing dynamic algebraic dependences
• Axiomatizing the monodic fragment of first-order temporal logic
• First-order temporal verification in practice
• The ins and outs of first-order runtime verification
• Monitoring metric first-order temporal properties
• Theoretical foundations of handling large substitution sets in temporal integrity monitoring
• Decidable fragments of first-order temporal logics
• Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting
• Undecidability of QLTL and QCTL with two variables and one monadic predicate letter

   Recommendations

• Monitoring dynamic integrity constraints based on temporal logic 👍 👎
• On Solving Temporal Logic Queries 👍 👎
• Theoretical foundations of handling large substitution sets in temporal integrity monitoring 👍 👎
• Quantified Positive Temporal Constraints 👍 👎
• Title not available (Why is that?) 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908342)