Inf-datalog, Modal Logic and Complexities

DOI10.1051/ITA:2007043zbMATH Open1170.68015OpenAlexW2125164700MaRDI QIDQ3549285FDOQ3549285

Authors: Eugénie Foustoucos, Irène Guessarian 

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

Recommendations

• Hilbertian deductive systems, infon logic, and Datalog
• Modal logic over finite structures
• Modality, bisimulation and interpolation in infinitary logic
• scientific article; zbMATH DE number 1670490
• Complexity results for modal dependence logic
• Complexity Results for Modal Dependence Logic
• Model-theoretic and computational properties of modal dependence logic
• Modal information logics: axiomatizations and decidability
• On the complexity of modal separation logics
• Modal logics in the theory of relational databases

zbMATH Keywords

performance evaluationdatabasesspecification languagesmodel-checking

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• The modal query language MDatalog
• On the semantics of deliberation in IndiGolog -- from theory to implementation
• On temporal logic versus Datalog
• The Data Complexity of MDatalog in Basic Modal Logics

Uses Software

• Datalog
• Mec 5

This page was built for publication: Inf-datalog, Modal Logic and Complexities

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