Knowledge representation using graph grammar rewriting system

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F10%3APU95972" target="_blank" >RIV/00216305:26230/10:PU95972 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Knowledge representation using graph grammar rewriting system
Original language description
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 programminglanguages 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 pushoutapproach (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.
Czech name
—
Czech description
—

Project
<a href="/en/project/7E08063" target="_blank" >7E08063: Emerging, Collective Intelligence for personal, organisational and social use</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)