1994 Fiscal Year Annual Research Report

アルゴリズム論に関する総合的研究

Research Project

Project/Area Number	06302013
Research Category	Grant-in-Aid for Co-operative Research (A)
Research Institution	Tokyo Institute of Technology
Principal Investigator	小林孝治郎東京工業大学, 大学院・情報理工学研究科, 教授 (00016148)
Co-Investigator(Kenkyū-buntansha)	佐藤雅彦東北大学, 電機通信研究所, 教授 (20027387) 小野寛晰北陸先端科学技術大学院大学, 情報科学研究科, 教授 (90055319) 伊藤達郎大阪教育大学, 教育学部, 教授 (90015909) 五十嵐滋筑波大学, 電子情報工学系, 教授 (80027367) 有川節夫九州大学, 理学部, 教授 (40037221)
Keywords	プログラム理論 / 計算モデル / プログラムの検証 / 時間の論理 / 関係代数 / 計算量理論 / グラフの構造 / 音楽情報処理
Research Abstract	計画通り4研究グループによる共同研究を行い,また合同シンポジウムにより,研究グループ間の研究交流を行った,主要な成果は,次の通りである. 「アルゴリズムの基礎理論」研究グループでは，関係代数に基づいてアルゴリズムの色々な問題を統一的に取り扱う試みについての結果が発表された．また，セルオートマトンの挙動に関する研究の流れにおいて従来不明であったいくつかの場合について，その挙動の解析結果が示された．「論理学とアルゴリズム論」研究グループでは，知識命題を取り扱うための論理体系の妥当性の検証を，従来知られていたモデル論的な手法ではなく，純粋に構文的な手法で決定するためのアルゴリズムが示された．また，ある種の直観主義線型論理の自然演繹体系に対応するλ項について，強正規性がなりたつことが示された．「プログラム言語と計算モデル」研究グループでは，プログラムの性質の解析における時間の論理の有用性が示され，また時間の論理の束論的な構造について，いくつかの新しい結果が得られた．また，再帰データ上でのデータ並列計算のための体系が提案されたほか，並列プロセス記述のための言語ISOSに対する，完全性を持つ証明体系が得られた．「具体的アルゴリズムと計算量」研究グループでは，マルチメディアシステムの研究のための枠組みの研究がなされた他，音楽情報処理に関して，自動伴奏における時間遅れの問題をランデブーの概念を利用して解決する試み，演奏表情を図形的な表現により分析しようとする試み，音楽表現の表情付けを音楽の構造の分析にもとづいて行う試みなどについて，いくつかの興味ある結果が得られた．

Research Products
(48 results)

All Other

All Publications (48 results)

[Publications] K.Kobayashi: "On coding theorems with modified length functions" Lecture Notes in Computer Science. 792. 255-259 (1994)
[Publications] S.Arikawa: "Towards a mathematical theory of a machine discovery from facts" Theoretical Computer Science. 137. 53-84 (1995)
[Publications] E.Hirowatari: "Partially isomorphic generalization and analogical reasoning" Lecture Notes in Artificial Intelligence. 784. 234-254 (1994)
[Publications] Y.Koga: "Explanation-based reuse of Prolog Programs" Lecture Notes in Artificial Intelligence. 872. 149-160 (1994)
[Publications] K.Tomita: "Analysis of a software/hardware.system.by tense arithmetic" Lecture Notes in Computer Science. 792. 188-205 (1994)
[Publications] S.Igarashi: "On locomorphism in analytical equivalence theory" Lecture Notes in Computer Science. 792. 173-187 (1994)
[Publications] 五十嵐滋: "演奏表情の表現と重奏システムへの応用" 第36回プログラミング・シンポジウム講演集. 47-56 (1995)
[Publications] 白銀哲也: "時間の論理の束モデルの拡張" 応用数学合同研究集会報告集. 6-1-6-3 (1994)
[Publications] 塩雅之: "時間の論理の束モデルの2次元解釈" 応用数学合同研究集会報告集. 5-1-5-6 (1994)
[Publications] 畑中秀行: "時間の論理の語モデルにおける同値性判定手続きの実現" 応用数学合同研究集会報告集. 4-1-4-2 (1994)
[Publications] 清野桂子: "音楽の演奏表情の図形的表現についての考察" 応用数学合同研究集会報告集. 7-1-7-4 (1994)
[Publications] S.Hohart: "Irredvcible T-modules of endpoint 1 for bilinear forms qraphs of diameter 3" 数理解析研究所講究録(“Algebraic Combinatorics"). (1994)
[Publications] H.Enomoto: "The condition of Beineke and Harary on edge-disjcint paths some of which are openly disjoint" Tokyo J.Math.17. 355-357 (1994)
[Publications] H.Enomoto: "Graph decompositions without isolated vertices" J.Combinatorial Theory(Ser.B). 63. 111-124 (1995)
[Publications] 大芝猛: "自動証明における自然な証明生成への一つの近接" 情報処理学会論文誌. 35. 222-231 (1994)
[Publications] R.K.Meyer: "The finite model Property for BCK and BCIW" Studia Logica. 53. 107-118 (1994)
[Publications] R.Hori: "Extending intuitionistic linear logic with knotted Structural rules" Notre Dome Journal of Formal Logic. 35. 219-242 (1994)
[Publications] T.Aoto: "Non-uniqueness of normal Proofs for minimal formulas in implication -conjunction fragment of BCK" Bulletin of the Section of Logic. 23. 104-112 (1994)
[Publications] S.Iwata: "The Othello game on an nxn board is PSPACE-complete" Theoretical Computer Science. 123. 329-340 (1994)
[Publications] S.Sawato: "Exhaustive computation to derive the lower bound for sorting 13 items" IEICE Trans.Inf.& Syst.E77-D. 1027-1031 (1994)
[Publications] Y.Egawa: "Sufficient conditions for a graph to have (q,f)-factors" Discrete Matheomatics,. (印刷中).
[Publications] M.Kano: "Edge-removing games of star type" Discrete Mathematics,. (印刷中).
[Publications] A.Kelmans: "Star partitions of graphs" Journal of Graph Theory,. (印刷中).
[Publications] Y.Kawahara: "Relational Structures and Their partial morphisms in the view of single pushout rewriting" Lectvre Notes in Computer Science. 776. 218-233 (1994)
[Publications] M.Sato: "A Purely functional language with encapsulated assignment" Lectvre Notes in Computer Science. 789. 179-202 (1994)
[Publications] M.Sato: "Conservativeness of Λ over λσ-calculus" Lecture Notes in Computer Science. 792. 73-94 (1994)
[Publications] 山中淳彦: "Assignment.を持つ純関数型言語Λの実現について" Workshop on Functional Programming JSSST′95報告集“関数プログラミングII". 201-216 (1994)
[Publications] 亀山幸義: "自己反映的証明体系RPTの理論と実現" コンピュータソフトウェア. (掲載予定).
[Publications] T.Nishino: "The Emptiness Problem for Iexical-functional grammars is undecidable" IEICE Trans on Information & Systems. E77-D. 597-600 (1994)
[Publications] T.Nishino: "A Simulation result for simultaneously bounded Aux PDAs" IEICE Trans on Information & Systems. E77-D. 720-722 (1994)
[Publications] T.Nishino: "On the negation-limited circuit complexity of clique functions" IEICE Trans on Information & Systems. E78-D. 86-89 (1995)
[Publications] T.Nishino: "On the number of negations needed to compute parity functions" IEICE Trans on Information & Systems. E78-D. 90-91 (1995)
[Publications] K.Tanaka: "On the complexity of negation-limited Boolean networks" Proc.of 26th ACM Symposium on Theory of Computing. 38-47 (1994)
[Publications] T.Mihara: "Quantum computation and NP-complete Problems" Lecture Notes in Computer Science. 834. 387-395 (1994)
[Publications] T.Mihara: "On a method of solving SAT efficiently using the quantum Turing machine" Proc.of the Workshop on Physics and Computation. 177-185 (1994)
[Publications] S.Shimozono: "Complexity of alphabet indexing" IEICE Trans on Information & Systems. E78-D. 13-19 (1995)
[Publications] T.Uchida: "Polynomial time algorithms for solving the refutation tree problem for formal graph systems" Bulletin of Informatics and Cybermetics. 26. 55-74 (1994)
[Publications] P.Orponen: "Instance complexity" Journal of ACM. 41. 96-121 (1994)
[Publications] O.Watanabe: "A framework for polynomial time query learnability" Mathematical Systems Theory. 27. 211-229 (1994)
[Publications] O.Watanabe: "Structural analysis of polynomial time query learnability" Mathematical Systems Theory. 27. 231-256 (1994)
[Publications] J.Balcazar: "The query complexity of learning DFA" New Generation Computing. 12. 337-358 (1994)
[Publications] T.Thierauf: "On closure properties of Gapp" Computational Complexity. 4. 242-261 (1994)
[Publications] J.Balcazar: "An optimal parallel algorithm for learning DFA" Proc.7th ACM Conference on Computational Learning Theory. 208-217 (1994)
[Publications] O.Watanabe: "Test instance generation for promised NP search problems" Proc.9th structure in Complexity Theory Conference. 205-216 (1994)
[Publications] R.Book: "On random.hard sets for NP" Lecture Notes in Computer Science. 834. 47-55 (1994)
[Publications] R.Rao: "Upward separation for Fewp and related classes" Inform.Process.Lett.52. 175-180 (1994)
[Publications] 小野寛晰: "情報代数" 共立出版, (1994)
[Publications] 小野寛晰: "情報科学における論理" 日本評論社, (1994)

1994 Fiscal Year Annual Research Report

アルゴリズム論に関する総合的研究

Principal Investigator

小林 孝治郎 東京工業大学, 大学院・情報理工学研究科, 教授 (00016148)

Research Products

[Publications] K.Kobayashi: "On coding theorems with modified length functions" Lecture Notes in Computer Science. 792. 255-259 (1994)

[Publications] S.Arikawa: "Towards a mathematical theory of a machine discovery from facts" Theoretical Computer Science. 137. 53-84 (1995)

[Publications] E.Hirowatari: "Partially isomorphic generalization and analogical reasoning" Lecture Notes in Artificial Intelligence. 784. 234-254 (1994)

[Publications] Y.Koga: "Explanation-based reuse of Prolog Programs" Lecture Notes in Artificial Intelligence. 872. 149-160 (1994)

[Publications] K.Tomita: "Analysis of a software/hardware.system.by tense arithmetic" Lecture Notes in Computer Science. 792. 188-205 (1994)

[Publications] S.Igarashi: "On locomorphism in analytical equivalence theory" Lecture Notes in Computer Science. 792. 173-187 (1994)

[Publications] 五十嵐 滋: "演奏表情の表現と重奏システムへの応用" 第36回プログラミング・シンポジウム講演集. 47-56 (1995)

[Publications] 白銀 哲也: "時間の論理の束モデルの拡張" 応用数学合同研究集会報告集. 6-1-6-3 (1994)

[Publications] 塩 雅之: "時間の論理の束モデルの2次元解釈" 応用数学合同研究集会報告集. 5-1-5-6 (1994)

[Publications] 畑中 秀行: "時間の論理の語モデルにおける同値性判定手続きの実現" 応用数学合同研究集会報告集. 4-1-4-2 (1994)

[Publications] 清野 桂子: "音楽の演奏表情の図形的表現についての考察" 応用数学合同研究集会報告集. 7-1-7-4 (1994)

[Publications] S.Hohart: "Irredvcible T-modules of endpoint 1 for bilinear forms qraphs of diameter 3" 数理解析研究所講究録(“Algebraic Combinatorics"). (1994)

[Publications] H.Enomoto: "The condition of Beineke and Harary on edge-disjcint paths some of which are openly disjoint" Tokyo J.Math.17. 355-357 (1994)

[Publications] H.Enomoto: "Graph decompositions without isolated vertices" J.Combinatorial Theory(Ser.B). 63. 111-124 (1995)

[Publications] 大芝 猛: "自動証明における自然な証明生成への一つの近接" 情報処理学会論文誌. 35. 222-231 (1994)

[Publications] R.K.Meyer: "The finite model Property for BCK and BCIW" Studia Logica. 53. 107-118 (1994)

[Publications] R.Hori: "Extending intuitionistic linear logic with knotted Structural rules" Notre Dome Journal of Formal Logic. 35. 219-242 (1994)

[Publications] T.Aoto: "Non-uniqueness of normal Proofs for minimal formulas in implication -conjunction fragment of BCK" Bulletin of the Section of Logic. 23. 104-112 (1994)

[Publications] S.Iwata: "The Othello game on an nxn board is PSPACE-complete" Theoretical Computer Science. 123. 329-340 (1994)

[Publications] S.Sawato: "Exhaustive computation to derive the lower bound for sorting 13 items" IEICE Trans.Inf.& Syst.E77-D. 1027-1031 (1994)

[Publications] Y.Egawa: "Sufficient conditions for a graph to have (q,f)-factors" Discrete Matheomatics,. (印刷中).

[Publications] M.Kano: "Edge-removing games of star type" Discrete Mathematics,. (印刷中).

[Publications] A.Kelmans: "Star partitions of graphs" Journal of Graph Theory,. (印刷中).

[Publications] Y.Kawahara: "Relational Structures and Their partial morphisms in the view of single pushout rewriting" Lectvre Notes in Computer Science. 776. 218-233 (1994)

[Publications] M.Sato: "A Purely functional language with encapsulated assignment" Lectvre Notes in Computer Science. 789. 179-202 (1994)

[Publications] M.Sato: "Conservativeness of Λ over λσ-calculus" Lecture Notes in Computer Science. 792. 73-94 (1994)

[Publications] 山中 淳彦: "Assignment.を持つ純関数型言語Λの実現について" Workshop on Functional Programming JSSST′95報告集“関数プログラミングII". 201-216 (1994)

[Publications] 亀山 幸義: "自己反映的証明体系RPTの理論と実現" コンピュータソフトウェア. (掲載予定).

[Publications] T.Nishino: "The Emptiness Problem for Iexical-functional grammars is undecidable" IEICE Trans on Information & Systems. E77-D. 597-600 (1994)

[Publications] T.Nishino: "A Simulation result for simultaneously bounded Aux PDAs" IEICE Trans on Information & Systems. E77-D. 720-722 (1994)

[Publications] T.Nishino: "On the negation-limited circuit complexity of clique functions" IEICE Trans on Information & Systems. E78-D. 86-89 (1995)

[Publications] T.Nishino: "On the number of negations needed to compute parity functions" IEICE Trans on Information & Systems. E78-D. 90-91 (1995)

[Publications] K.Tanaka: "On the complexity of negation-limited Boolean networks" Proc.of 26th ACM Symposium on Theory of Computing. 38-47 (1994)

[Publications] T.Mihara: "Quantum computation and NP-complete Problems" Lecture Notes in Computer Science. 834. 387-395 (1994)

[Publications] T.Mihara: "On a method of solving SAT efficiently using the quantum Turing machine" Proc.of the Workshop on Physics and Computation. 177-185 (1994)

[Publications] S.Shimozono: "Complexity of alphabet indexing" IEICE Trans on Information & Systems. E78-D. 13-19 (1995)

[Publications] T.Uchida: "Polynomial time algorithms for solving the refutation tree problem for formal graph systems" Bulletin of Informatics and Cybermetics. 26. 55-74 (1994)

[Publications] P.Orponen: "Instance complexity" Journal of ACM. 41. 96-121 (1994)

[Publications] O.Watanabe: "A framework for polynomial time query learnability" Mathematical Systems Theory. 27. 211-229 (1994)

[Publications] O.Watanabe: "Structural analysis of polynomial time query learnability" Mathematical Systems Theory. 27. 231-256 (1994)

[Publications] J.Balcazar: "The query complexity of learning DFA" New Generation Computing. 12. 337-358 (1994)

[Publications] T.Thierauf: "On closure properties of Gapp" Computational Complexity. 4. 242-261 (1994)

[Publications] J.Balcazar: "An optimal parallel algorithm for learning DFA" Proc.7th ACM Conference on Computational Learning Theory. 208-217 (1994)

[Publications] O.Watanabe: "Test instance generation for promised NP search problems" Proc.9th structure in Complexity Theory Conference. 205-216 (1994)

[Publications] R.Book: "On random.hard sets for NP" Lecture Notes in Computer Science. 834. 47-55 (1994)

[Publications] R.Rao: "Upward separation for Fewp and related classes" Inform.Process.Lett.52. 175-180 (1994)

[Publications] 小野 寛晰: "情報代数" 共立出版, (1994)

[Publications] 小野 寛晰: "情報科学における論理" 日本評論社, (1994)

小林孝治郎東京工業大学, 大学院・情報理工学研究科, 教授 (00016148)

[Publications] 五十嵐滋: "演奏表情の表現と重奏システムへの応用" 第36回プログラミング・シンポジウム講演集. 47-56 (1995)

[Publications] 白銀哲也: "時間の論理の束モデルの拡張" 応用数学合同研究集会報告集. 6-1-6-3 (1994)

[Publications] 塩雅之: "時間の論理の束モデルの2次元解釈" 応用数学合同研究集会報告集. 5-1-5-6 (1994)

[Publications] 畑中秀行: "時間の論理の語モデルにおける同値性判定手続きの実現" 応用数学合同研究集会報告集. 4-1-4-2 (1994)

[Publications] 清野桂子: "音楽の演奏表情の図形的表現についての考察" 応用数学合同研究集会報告集. 7-1-7-4 (1994)

[Publications] 大芝猛: "自動証明における自然な証明生成への一つの近接" 情報処理学会論文誌. 35. 222-231 (1994)

[Publications] 山中淳彦: "Assignment.を持つ純関数型言語Λの実現について" Workshop on Functional Programming JSSST′95報告集“関数プログラミングII". 201-216 (1994)

[Publications] 亀山幸義: "自己反映的証明体系RPTの理論と実現" コンピュータソフトウェア. (掲載予定).

[Publications] 小野寛晰: "情報代数" 共立出版, (1994)

[Publications] 小野寛晰: "情報科学における論理" 日本評論社, (1994)