Modal Expressiveness of Graph Properties

@article{Benevides2008ModalEO,
  title={Modal Expressiveness of Graph Properties},
  author={Mario R. F. Benevides and L. Menasch{\'e} Schechter},
  journal={Electr. Notes Theor. Comput. Sci.},
  year={2008},
  volume={205},
  pages={31-47}
}
Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclicity and the Eulerian and Hamiltonian properties in a modal logic. First, we show that these graph properties are not definable in a basic modal language. Second, we discuss an extension of the basic modal language with fix-point operators, the modal @m-calculus. Unfortunately, even with all its expressive power, the @m… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-3 OF 3 CITATIONS

Dynamic logics of networks: Information flow and the spread of opinion

VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A logic for diffusion in social networks

  • J. Applied Logic
  • 2015
VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

A Logical Approach to Hamiltonian Graphs

  • Electr. Notes Theor. Comput. Sci.
  • 2009
VIEW 3 EXCERPTS
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 15 REFERENCES

M

P. Blackburn
  • de Rijke, and Y. Venema. Modal Logic. Theoretical Tracts in Computer Science. Cambridge University Press
  • 2001
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Modal Mu-Calculi

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

On the expressive power of CTL

  • Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)
  • 1999
VIEW 12 EXCERPTS
HIGHLY INFLUENTIAL

CTL* and ECTL* as Fragments of the Modal mu-Calculus

  • Theor. Comput. Sci.
  • 1992
VIEW 13 EXCERPTS
HIGHLY INFLUENTIAL

Hybrid logics

  • Handbook of Modal Logic
  • 2007
VIEW 3 EXCERPTS

Lectures on the modal mu-calculus

Y. Venema
  • 2007
VIEW 1 EXCERPT