Inf-datalog, Modal Logic and Complexities
From MaRDI portal
Publication:3549285
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
Cites work
- scientific article; zbMATH DE number 1059247 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 1500523 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 1392287 (Why is no real title available?)
- A deterministic subexponential algorithm for solving parity games
- A linear algorithm to solve fixed-point equations on transition systems
- A linear-time model-checking algorithm for the alternation-free modal mu- calculus
- An improved algorithm for the evaluation of fixpoint expressions
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Computer Aided Verification
- Fast and simple nested fixpoints
- Finiteness is mu-ineffable
- Fixpoint alternation: arithmetic, transition systems, and the binary tree
- Monadic Datalog and the expressive power of languages for web information extraction
- On temporal logic versus Datalog
- Results on the propositional \(\mu\)-calculus
- Rudiments of \(\mu\)-calculus
Cited in
(4)
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)