Inf-datalog, Modal Logic and Complexities

DOI10.1051/ita:2007043zbMath1170.68015OpenAlexW2125164700MaRDI QIDQ3549285

Irène Guessarian, Eugénie Foustoucos

Publication date: 22 December 2008

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92905

zbMATH Keywords

performance evaluationspecification languagesmodel-checkingdatabases

Mathematics Subject Classification ID

Database theory (68P15) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17) Temporal logic (03B44) Descriptive complexity and finite models (68Q19)

Uses Software

• Datalog
• Mec 5

Cites Work

• Results on the propositional \(\mu\)-calculus
• A linear algorithm to solve fixed-point equations on transition systems
• Finiteness is mu-ineffable
• Fast and simple nested fixpoints
• An improved algorithm for the evaluation of fixpoint expressions
• On temporal logic versus Datalog
• A linear-time model-checking algorithm for the alternation-free modal mu- calculus
• A deterministic subexponential algorithm for solving parity games
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Fixpoint alternation: arithmetic, transition systems, and the binary tree
• Computer Aided Verification
• Monadic datalog and the expressive power of languages for Web information extraction
• Rudiments of \(\mu\)-calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item