 
Summary: Modal Expressiveness of Graph
Properties
LSFA 2007
Mario Benevides
and
Luis Menasch´e Schechter
{mario,luis}@cos.ufrj.br
COPPE  UFRJ
Modal Expressiveness of Graph Properties p.
Introduction
Goal: In this work, we analyze how we can
express global graph properties (connectivity,
acyclicity and the Hamiltonian and Eulerian
properties) in a modal logic.
Why graphs? Graphs are among the most
frequently used structures in Computer Science.
In this discipline, usually many important
concepts admit a graph representation, and
sometimes a graph lies at the very kernel of the
model of computation used.
