ITEM METADATA RECORD
Title: On the inference of non-confluent NLC graph grammars
Authors: Brijder, Robert ×
Blockeel, Hendrik #
Issue Date: Aug-2013
Publisher: Oxford University Press
Series Title: Journal of Logic and Computation vol:23 issue:4 pages:799-814
Abstract: Grammar inference deals with determining (preferably simple) models/grammars consistent with a set of observations. There is a large body of research on grammar inference within the theory of formal languages. However, there is surprisingly little known on grammar inference for graph grammars. In this paper we take a further step in this direction and work within the framework of node label controlled (NLC) graph grammars. Specifically, we characterize, given a set of disjoint and isomorphic subgraphs of a graph G, whether or not there is a NLC graph grammar rule which can generate these subgraphs to obtain
G. This generalizes previous results by assuming that the set of isomorphic subgraphs is disjoint instead of non-touching. This leads naturally to consider the more involved ''non-confluent'' graph grammar rules.
ISSN: 0955-792X
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
nlc_induction.pdfmain article Published 196KbAdobe PDFView/Open

 


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science