Polynomial hierarchy graph properties in hybrid logic

Título:

Polynomial hierarchy graph properties in hybrid logic

Autor:

Mario Roberto Folhadela Benevides

Ano:

2014

DOI:

10.1016/j.jcss.2014.04.003

Revista:

Journal of Computer and System Sciences (Print)

ISSN:

00220000

Tags:

NP-Completeness

Home:

[doi:10.1016/j.jcss.2014.04.003]

Idioma:

Inglês

Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

Reasoning about Knowledge in Asychronous Distributed Systems

On a graph calculus for modalities

Using modal logics to express and check global graph properties

Formalizing Concurrent Common Knowledge as Product of Modal Logic

Bisimilar and logically equivalent programs in PDL with parallel operator

On vague notions and modalities: a modular approach

A study on multi-dimensional products of graphs and hybrid logics

Action Models with Postconditions

Towards reasoning about Petri nets: A Propositional Dynamic Logic based approach

Propositional dynamic logics for communicating concurrent programs with CCS's parallel operator