Using modal logics to express and check global graph properties

DOI10.1093/jigpal/jzp021zbMath1181.03032OpenAlexW2160355448MaRDI QIDQ3644844

L. Menasché Schechter, Mario R. F. Benevides

Publication date: 12 November 2009

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

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

zbMATH Keywords

computational complexitymodal logicgraphsmodel-checkingframe-checking

Mathematics Subject Classification ID

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

Related Items (4)

The expressibility of fragments of hybrid graph logic on finite digraphs ⋮ A study on multi-dimensional products of graphs and hybrid logics ⋮ Polynomial hierarchy graph properties in hybrid logic ⋮ A logic for diffusion in social networks

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