Graph Abstraction for a Modal Logic

Share/Save/Bookmark

Boneva, Iovka and Kreiker, Jörg and Kurban, Marcos E. and Rensink, Arend (2009) Graph Abstraction for a Modal Logic. Bulletin of the European Association for Theoretical Computer Science, 97 . pp. 106-116. ISSN 0252-9742

[img] PDF
Restricted to UT campus only
: Request a copy
300kB
Abstract:We are studying a particular graph abstraction, based on the concept of retaining neighbourhood information up to a certain radius for each node. In this contribution, we present a modal logic on graphs that is preserved and reflected by this abstraction. This is one of the main results from the EATCS Best Theoretical Paper at the International Conference on Graph Transformation 2008.
Item Type:Article
Copyright:© 2009 European Association for Theoretical Computer Science
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/75905
Official URL:http://www.eatcs.org/images/bulletin/beatcs97.pdf
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page