On temporal logic versus Datalog
From MaRDI portal
Publication:1401358
DOI10.1016/S0304-3975(02)00447-4zbMath1019.03021OpenAlexW1991940824MaRDI QIDQ1401358
Eugénie Foustoucos, Theodore Andronikos, Irène Guessarian, Foto N. Afrati
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00447-4
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17) Temporal logic (03B44)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Results on the propositional \(\mu\)-calculus
- Modal languages and bounded fragments of predicate logic
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
- Reasoning about infinite computations
- Toupie: The \(\mu\)-calculus over finite domains as a constraint language
- Fixed point characterization of infinite behavior of finite-state systems
- Counting on CTL\(^*\): On the expressive power of monadic path logic
- Modalities for model checking: Branching time logic strikes back
- Implementation of logical query languages for databases
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- A note on the complexity of the satisfiability of modal Horn clauses
- “Sometimes” and “not never” revisited
- Fixpoint alternation: arithmetic, transition systems, and the binary tree
- An automata-theoretic approach to branching-time model checking
- Rudiments of \(\mu\)-calculus
This page was built for publication: On temporal logic versus Datalog
