On temporal logic versus Datalog
type: Item
instance of: scholarly article
title: On temporal logic versus Datalog
zbMATH Open document ID: 1019.03021
DOI: 10.1016/S0304-3975(02)00447-4
author: Irène Guessarian
author: Eugénie Foustoucos
author: Theodore Andronikos
author: Foto N. Afrati
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B44
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 1965367
zbMATH Keywords: verification
zbMATH Keywords: temporal logic
zbMATH Keywords: Datalog
describes a project that uses: Oz
describes a project that uses: Datalog
MaRDI profile type: Publication
cites work: Q4864249
cites work: Modal languages and bounded fragments of predicate logic
cites work: Q4289659
cites work: Rudiments of \(\mu\)-calculus
cites work: Fixpoint alternation: arithmetic, transition systems, and the binary tree
cites work: Modal logics and mu-calculi: An introduction
cites work: Automatic verification of finite-state concurrent systems using temporal logic specifications
cites work: Toupie: The \(\mu\)-calculus over finite domains as a constraint language
cites work: CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
cites work: Q4385542
cites work: Q4353562
cites work: Q3906386
cites work: “Sometimes” and “not never” revisited
cites work: Modalities for model checking: Branching time logic strikes back
cites work: A note on the complexity of the satisfiability of modal Horn clauses
cites work: Q3768883
cites work: Results on the propositional \(\mu\)-calculus
cites work: An automata-theoretic approach to branching-time model checking
cites work: Counting on CTL\(^*\): On the expressive power of monadic path logic
cites work: The modal query language MDatalog
cites work: Fixed point characterization of infinite behavior of finite-state systems
cites work: Q5624635
cites work: Q4385530
cites work: Implementation of logical query languages for databases
cites work: Reasoning about infinite computations
cites work: Q4501666
full work available at URL: s0304-3975(02)00447-4
OpenAlex ID: W1991940824
description: scientific article; zbMATH DE number 1965367