Resumen:
In this paper we tackle the problem of extending the logic of nested graph conditions with paths. This means, for instance, that we may state properties about the existence of paths between some given nodes. As a main contribution, a sound and complete tableau method is defined for reasoning about this kind of properties.
Descargas:
Este artículo tiene una licencia de uso CreativeCommons Reconocimiento – NoComercial (by-nc)
Descarga el artículo haciendo click aquí.
Ver la referencia en formato Bibtex
@inproceedings{prole:2016:009,
title={{A Logic of Graph Conditions Extended with Paths}},
author={Marisa Navarro and Fernando Orejas and Elvira Pino and Leen Lambers},
url={http://hdl.handle.net/11705/PROLE/2016/009},
booktitle={PROLE2016},
year={2016},
publisher={SISTEDES},
crossref={prole2016salamanca}
}
@proceedings{prole2016salamanca,
title={{Actas de las XVI Jornadas de Programaci{\'o}n y Lenguajes (PROLE 2016)}},
editor={Villanueva, A.},
booktitle={PROLE2016},
year={2016},
publisher={SISTEDES}
}
Copiar al portapapeles |
Cerrar
