Detail publikace
Knowledge representation using graph grammar rewriting system
Originální název
Knowledge representation using graph grammar rewriting system
Anglický název
Knowledge representation using graph grammar rewriting system
Jazyk
en
Originální abstrakt
Graph rewriting systems are applicable to vast majority of problems that are being solved in computer science. From problems concerning program optimization, software verification, description, and parsing of structured information to graph programming languages and layout algorithms. Graph rewriting systems are often represented as sets of productions describing transformations on graphs. Each production encapsulates complete information about applicable graph modification. In context of described rewriting system is production atomic operation. A novel approach to graph rewriting and criteria for production application enabling development of exhaustive graph rewrite system is introduced.Presented approach is derived from well known double pushout approach (DPO). This paper concentrates on discussion of knowledge formalization representation for modeling concepts and on application of these concepts using the proposedprorgrammed graph rewriting system.
Anglický abstrakt
Graph rewriting systems are applicable to vast majority of problems that are being solved in computer science. From problems concerning program optimization, software verification, description, and parsing of structured information to graph programming languages and layout algorithms. Graph rewriting systems are often represented as sets of productions describing transformations on graphs. Each production encapsulates complete information about applicable graph modification. In context of described rewriting system is production atomic operation. A novel approach to graph rewriting and criteria for production application enabling development of exhaustive graph rewrite system is introduced.Presented approach is derived from well known double pushout approach (DPO). This paper concentrates on discussion of knowledge formalization representation for modeling concepts and on application of these concepts using the proposedprorgrammed graph rewriting system.
BibTex
@inproceedings{BUT76270,
author="Pavel {Zemčík} and Jiří {Zuzaňák}",
title="Knowledge representation using graph grammar rewriting system",
annote="Graph rewriting systems are applicable to vast majority of problems that
are being solved in computer science. From problems concerning
program optimization, software verification, description, and parsing of
structured information to graph programming languages and layout
algorithms. Graph rewriting systems are often represented as sets of productions
describing transformations on graphs. Each production encapsulates complete
information about applicable graph modification. In context of described
rewriting system is production atomic operation. A novel approach to graph
rewriting and criteria for production application enabling development of
exhaustive graph rewrite system is introduced.Presented approach is derived from
well known double pushout approach (DPO). This paper concentrates on discussion
of knowledge formalization representation for modeling concepts and on
application of these concepts using the proposedprorgrammed graph rewriting
system.",
address="University of West Bohemia in Pilsen",
booktitle="POSTER Papers proceedings",
chapter="76270",
edition="NEUVEDEN",
howpublished="print",
institution="University of West Bohemia in Pilsen",
year="2010",
month="september",
pages="143--149",
publisher="University of West Bohemia in Pilsen",
type="conference paper"
}