Title :
Polynomial Time Mat Learning of C-deterministic Regular Formal Graph Systems
Author :
Hara, Satoshi ; Shoudai, Takayoshi
Author_Institution :
Dept. of Inf., Kyushu Univ., Fukuoka, Japan
fDate :
Aug. 31 2014-Sept. 4 2014
Abstract :
Formal graph system (FGS) is a logic program that deals with term graphs instead of the terms of first-order predicate logic. In this paper, we introduce context-deterministic (c-deterministic) regular FGSs as a subclass of FGSs and propose a polynomial time algorithm for learning the class of c-deterministic regular FGSs by using membership and equivalence queries in the framework of MAT learning.
Keywords :
computational complexity; computer science education; graph grammars; graph theory; logic programming; query processing; c-deterministic regular formal graph systems; context- deterministic regular FGS; equivalence queries; first-order predicate logic; logic program; membership queries; minimally adequate teacher learning; polynomial time algorithm; time MAT learning; Bismuth; Context; Grammar; Informatics; Mercury (metals); Polynomials; Ports (Computers); algorithmic learning theory; formal graph system; graph grammar; graph pattern language; query learning;
Conference_Titel :
Advanced Applied Informatics (IIAIAAI), 2014 IIAI 3rd International Conference on
Conference_Location :
Kitakyushu
Print_ISBN :
978-1-4799-4174-2
DOI :
10.1109/IIAI-AAI.2014.51
