Graph Abstraction for a Modal Logic

Iovka Boneva; H Ehrig; Jörg Kreiker; M.E. Kurban; Arend Rensink

Graph Abstraction for a Modal Logic

Iovka Boneva
, H Ehrig (Editor)
, Jörg Kreiker
, M.E. Kurban
, Arend Rensink

Research output: Contribution to journal › Article › Academic

1 Downloads (Pure)

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.

Original language	Undefined
Pages (from-to)	106-116
Number of pages	11
Journal	Bulletin of the European Association for Theoretical Computer Science
Volume	97
Publication status	Published - Feb 2009

Keywords

EWI-19548
IR-75905
METIS-275916

Access to Document

Cite this

@article{f72316b7bc044c32ab727ac1c2606551,

title = "Graph Abstraction for a Modal Logic",

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.",

keywords = "EWI-19548, IR-75905, METIS-275916",

author = "Iovka Boneva and H Ehrig and J{\"o}rg Kreiker and M.E. Kurban and Arend Rensink",

year = "2009",

month = feb,

language = "Undefined",

volume = "97",

pages = "106--116",

journal = "Bulletin of the European Association for Theoretical Computer Science",

issn = "0252-9742",

publisher = "European Association for Theoretical Computer Science",

}

TY - JOUR

T1 - Graph Abstraction for a Modal Logic

AU - Boneva, Iovka

AU - Kreiker, Jörg

AU - Kurban, M.E.

AU - Rensink, Arend

A2 - Ehrig, H

PY - 2009/2

Y1 - 2009/2

N2 - 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.

AB - 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.

KW - EWI-19548

KW - IR-75905

KW - METIS-275916

M3 - Article

SN - 0252-9742

VL - 97

SP - 106

EP - 116

JO - Bulletin of the European Association for Theoretical Computer Science

JF - Bulletin of the European Association for Theoretical Computer Science

ER -