## ＜学術雑誌論文＞Polynomial Time Algorithm Solving the Refutation Tree Problem for Formal Graph Systems

作成者 作成者名 所属機関 所属機関名 Department of Information Systems, Kyushu University 九州大学大学院総合理工学研究科情報システム学専攻 著者識別子 作成者名 所属機関 所属機関名 College of General Education, Kyushu University 九州大学教養部 著者識別子 作成者名 所属機関 所属機関名 Research Institute of Fundamental Information Science, Kyushu University 九州大学理学部附属基礎情報学研究施設 英語 Research Association of Statistical Sciences 統計科学研究会 1993-09-30 1994-03 26 1/2 55 74 Version of Record open access https://doi.org/10.5109/3069 RIFIS Technical Report ; 75 RIFIS Technical Report || 75 Bulletin of informatics and cybernetics || 26(1/2) || p55-74 http://bic.math.kyushu-u.ac.jp/ RIFIS Technical Report || 75 Bulletin of informatics and cybernetics || 26(1/2) || p55-74 http://bic.math.kyushu-u.ac.jp/ RIFIS Technical Report ; 75 RIFIS Technical Report || 75 Bulletin of informatics and cybernetics || 26(1/2) || p55-74 http://bic.math.kyushu-u.ac.jp/ The refutation tree problem for a formal graph system (FGS) is to compute a refutation tree which represents the logical structure of a graph generated by the FGS. We present three subclasses of FGSs:... simple FGSs, size-bounded simple FGSs, and bounded simple FGSs. We give a polynomial-time algorithm solving the refutation tree problem for simple FGSs. For sizebounded simple FGSs generating undirected trees of constantly bounded valence, we show that a refutation tree of a graph definable by the FGS can be computed in NC^2. Moreover, we indicate that the refutation tree problem for bounded simple FGSs is in NC^2.続きを見る

### 本文ファイル

75.ps tgz 213 KB 85 RIFIS Technical Report
75.ps.tar pdf 264 KB 190 RIFIS Technical Report
p055 pdf 1.17 MB 314 Bulletin of Informatics and Cybernetics

### 詳細

PISSN 0286-522X 2435-743X AA10634475 3069 査読有 2009.04.22 2020.10.22