Open Access
Parallel Algorithms for Refutation Tree Problem on Formal Graph Systems
Tomoyuki Uchida,智之 内田,Takayoshi Shoudai,隆義 正代,Satoru Miyano,悟 宮野 +5 more
- Vol. 59
TLDR
It is proved that a class of graphs is generated by a hyperedge replacement grammar if and only if it is defined by an FGS of a special form called a regular FGS, which is a logic program having hypergraphs instead of terms in first-order logic.About:
The article was published on 1992-07-20 and is currently open access. It has received 24 citations till now. The article focuses on the topics: SPQR tree & Tree decomposition.read more
Citations
More filters
Book ChapterDOI
Discovery of Frequent Tree Structured Patterns in Semistructured Web Documents
TL;DR: An algorithm for finding all maximally frequent tag tree patterns in semistructured data such as Web documents is presented and some experimental results on XML documents are reported by using the algorithm.
Journal ArticleDOI
Ordered term tree languages which are polynomial time inductively inferable from positive data
TL;DR: In this paper, a linear ordered term tree (LOMT) is proposed to represent structural features common to semistructured data, which is a rooted tree pattern consisting of ordered tree structures and internal structured variables with distinct variable labels.
Journal ArticleDOI
Learning block-preserving graph patterns and its application to data mining
TL;DR: A new graph pattern is defined, which is called a block preserving graph pattern (bp-graph pattern) for C, and two incremental polynomial time algorithms for enumerating all frequent bp-graph patterns with respect to a given finite set of graphs in C are proposed.
Book ChapterDOI
Polynomial Time Matching Algorithms for Tree-Like Structured Patterns in Knowledge Discovery
TL;DR: A matching problem for a regular term tree t and a standard tree T is considered, which decides whether or not there exists a tree T′ such that T′ is isomorphic to T andT′ is obtained by replacing variables in t with some trees.
Book ChapterDOI
Discovering New Knowledge from Graph Data Using Inductive Logic Programming
Tetsuhiro Miyahara,Takayoshi Shoudai,Tomoyuki Uchida,Tetsuji Kuboyama,Kenichi Takahashi,Hiroaki Ueda +5 more
TL;DR: A logical foundation of the knowledge discovery system KD-FGS is developed, which acquires knowledge directly from graph data by using FGS as a knowledge representation language and a polynomial-time algorithm is given for finding a unifier of a term tree and a tree to make consistency checks efficiently.
References
More filters
Book
An Efficient Parallel Biconnectivity Algorithm
Robert E. Tarjan,Uzi Vishkin +1 more
TL;DR: A new algorithm for finding the blocks (biconnected components) of an undirected graph and a general algorithmic technique that simplifies and improves computation of various functions on trees is introduced.
Book
Theory of formal systems
TL;DR: In this paper, a self-contained introduction to recursive function theory and its application to formal systems is given, as well as an exposition of new results in the field of recursive functions.
BookDOI
Graph-grammars and their application to computer science : 2nd international workshop, Haus Ohrbeck, Germany, October 4 - 8, 1982
Journal ArticleDOI
Boundary NLC graph grammars--basic definitions, normal forms, and complexity
Grzegorz Rozenberg,Emo Welzl +1 more
TL;DR: The boundary NLC (BNLC) grammars as discussed by the authors are a generalization of node label controlled (NLC) graphs, which define languages of undirected node labeled graphs (or, if we just omit the labels, languages of unlabeled graphs).
Journal ArticleDOI
Parallel ear decomposition search (EDS) and st -numbering in graphs
TL;DR: A general method for searching efficiently in parallel undirected graphs, called ear-decomposition search (EDS), based on depth-first search (DFS), is presented.