Using modal logics to express and check global graph properties

DOI10.1093/JIGPAL/JZP021MaRDI QIDQ3644844zbMATH OpenOpenAlexFDO

Authors Mario Benevides, L. Menasché Schechter

Publication date 12 November 2009

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/a1ea6529de5a079165db097d990d0c368a0a6d40

zbMATH Keywords

computational complexityframe-checkinggraphsmodal logicmodel-checking

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Combined logics (03B62) Logic in computer science (03B70) Eulerian and Hamiltonian graphs (05C45) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Modal expressiveness of graph properties
• A Logical Approach to Hamiltonian Graphs
• scientific article; zbMATH DE number 2020180
• Hybrid logics and NP graph properties
• Polynomial hierarchy graph properties in hybrid logic

Cited in

(7)

• A logic for diffusion in social networks
• The expressibility of fragments of hybrid graph logic on finite digraphs
• Polynomial hierarchy graph properties in hybrid logic
• Modal expressiveness of graph properties
• Hybrid logics and NP graph properties
• Global and local graph modifiers
• A study on multi-dimensional products of graphs and hybrid logics

This page was built for publication: Using modal logics to express and check global graph properties

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