Polynomial Time Mat Learning of C-deterministic Regular Formal Graph Systems
Seiya Hara, Takayoshi Shoudai · 2014
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.