Hybrid logics and NP graph properties

Authors:
Francicleber Martins Ferreira;Cibele Matos Freire;Mario R. F. Benevides;L. Menasché Schechter;Ana Teresa Martins
Affiliations:
Federal University of Ceará, Computer Science Department;Federal University of Ceará, Computer Science Department;Federal University of Rio de Janeiro, COPPE/Systems;Federal University of Rio de Janeiro, Department of Computer Science;Federal University of Ceará, Computer Science Department
Venue:
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Year:
2011

Citing 5
Cited 0

An introduction to distributed algorithms

An introduction to distributed algorithms
The four-colour theorem

Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
Why are modal logics so robustly decidable?

Current trends in theoretical computer science
Modal logic

Modal logic
Distributed Algorithms

Distributed Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that for each property of graphs G in NP there is a sequence Ø1, Ø2, . . . of formulas of the full hybrid logic which are satisfied exactly by the frames in G. Moreover, the size of Øn is bounded by a polynomial. We also show that the same holds for each graph property in the polynomial hierarchy.