scientific article; zbMATH DE number 2090317

zbMath1072.03014MaRDI QIDQ4809076

Orna Kupferman, Moshe Y. Vardi, Ulrike Sattler

Publication date: 12 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2392/23920423.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (21)

Graded modalities in strategy logic ⋮ Complexity of modal logics with Presburger constraints ⋮ XML schema, tree logic and sheaves automata ⋮ Reasoning About Strategies ⋮ Expressiveness and succinctness of a logic of robustness ⋮ Enriched μ–Calculus Pushdown Module Checking ⋮ Reasoning About Substructures and Games ⋮ Unnamed Item ⋮ Reasoning about graded strategy quantifiers ⋮ CTL Model-Checking with Graded Quantifiers ⋮ Completeness for \(\mu\)-calculi: a coalgebraic approach ⋮ Sublogics of a branching time logic of robustness ⋮ Answering regular path queries in expressive description logics via alternating tree-automata ⋮ Multitree automata that count ⋮ CTL\(^\ast\) with graded path modalities ⋮ Model-checking graded computation-tree logic with finite path semantics ⋮ Quasipolynomial computation of nested fixpoints ⋮ EXPTIME Tableaux for the Coalgebraic μ-Calculus ⋮ The model checking fingerprints of CTL operators ⋮ On the undecidability of logics with converse, nominals, recursion and counting ⋮ Decidability of SHIQ with complex role inclusion axioms

This page was built for publication: