The SCEAS System
| |||||||

## Search the dblp DataBase
Kouichi Hirata:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Kouichi Hirata
**On the Hardness of Learning Acyclic Conjunctive Queries.**[Citation Graph (0, 0)][DBLP] ALT, 2000, pp:238-251 [Conf] - Kouichi Hirata
**Rule-Generating Abduction for Recursive Prolog.**[Citation Graph (0, 0)][DBLP] AII/ALT, 1994, pp:121-136 [Conf] - Kouichi Hirata
**Flattening and Implication.**[Citation Graph (0, 0)][DBLP] ATL, 1999, pp:157-168 [Conf] - Noriko Sugimoto, Kouichi Hirata, Hiroki Ishizaka
**Constructive Learning of Translations Based on Dictionaries.**[Citation Graph (0, 0)][DBLP] ALT, 1996, pp:177-184 [Conf] - Kouichi Hirata, Keizo Yamada, Masateru Harao
**Tractable and Intractable Second-Order Matching Problems.**[Citation Graph (0, 0)][DBLP] COCOON, 1999, pp:432-441 [Conf] - Kouichi Hirata, Ryosuke Nagazumi, Masateru Harao
**Extraction of Coverings as Monotone DNF Formulas.**[Citation Graph (0, 0)][DBLP] Discovery Science, 2003, pp:166-179 [Conf] - Takashi Katoh, Kouichi Hirata, Masateru Harao
**Mining Sectorial Episodes from Event Sequences.**[Citation Graph (0, 0)][DBLP] Discovery Science, 2006, pp:137-148 [Conf] - Nobuhito Ohkura, Kouichi Hirata, Tetsuji Kuboyama, Masateru Harao
**The**[Citation Graph (0, 0)][DBLP]*q*-Gram Distance for Ordered Unlabeled Trees. Discovery Science, 2005, pp:189-202 [Conf] - Yoshikazu Shima, Shinji Mitsuishi, Kouichi Hirata, Masateru Harao
**Extracting Minimal and Closed Monotone DNF Formulas.**[Citation Graph (0, 0)][DBLP] Discovery Science, 2004, pp:298-305 [Conf] - Kouichi Hirata, Megumi Kuwabara, Masateru Harao
**On Finding Acyclic Subhypergraphs.**[Citation Graph (0, 0)][DBLP] FCT, 2005, pp:491-503 [Conf] - Kouichi Hirata, Hiroshi Sakamoto
**Prediction-Preserving Reducibility with Membership Queries on Formal Languages.**[Citation Graph (0, 0)][DBLP] FCT, 2001, pp:172-183 [Conf] - Noriko Sugimoto, Takashi Toyoshima, Shinichi Shimozono, Kouichi Hirata
**Constructive Learning of Context-Free Languages with a Subpansive Tree.**[Citation Graph (0, 0)][DBLP] ICGI, 2000, pp:270-283 [Conf] - Kouichi Hirata
**On Condensation of a Clause.**[Citation Graph (0, 0)][DBLP] ILP, 2003, pp:164-179 [Conf] - Kouichi Hirata, Takeshi Ogawa, Masateru Harao
**Generalization Algorithms for Second-Order Terms.**[Citation Graph (0, 0)][DBLP] ILP, 2004, pp:147-163 [Conf] - Kosuke Ono, Takashi Hata, Toyofumi Maetani, Masateru Harao, Kouichi Hirata
**Development of a Multi-Agent Based Generic Traffic Simulator.**[Citation Graph (0, 0)][DBLP] JSAI Workshops, 2005, pp:249-260 [Conf] - Eiju Hirowatari, Kouichi Hirata, Tetsuhiro Miyahara
**Prediction of Recursive Real-Valued Functions from Finite Examples.**[Citation Graph (0, 0)][DBLP] JSAI Workshops, 2005, pp:224-234 [Conf] - Megumi Kuwabara, Takeshi Ogawa, Kouichi Hirata, Masateru Harao
**On Generalization and Subsumption for Ordered Clauses.**[Citation Graph (0, 0)][DBLP] JSAI Workshops, 2005, pp:212-223 [Conf] - Akihiro Yamamoto, Kouichi Hirata
**Workshop on Learning with Logics and Logics for Learning (LLLL).**[Citation Graph (0, 0)][DBLP] JSAI Workshops, 2005, pp:167-168 [Conf] - Akihiro Yamamoto, Kouichi Hirata, Ken Satoh
**The Fourth Workshop on Learning with Logics and Logics for Learning (LLLL2006).**[Citation Graph (0, 0)][DBLP] JSAI, 2006, pp:249-250 [Conf] - Kouichi Hirata
**A classification of abduction: abduction for logic programming.**[Citation Graph (0, 0)][DBLP] Machine Intelligence 14, 1993, pp:405-0 [Conf] - Yoshikazu Shima, Kouichi Hirata, Masateru Harao
**Extraction of Frequent Few-Overlapped Monotone DNF Formulas with Depth-First Pruning.**[Citation Graph (0, 0)][DBLP] PAKDD, 2005, pp:50-60 [Conf] - Kouichi Hirata, Shinichi Shimozono, Ayumi Shinohara
**On the Hardness of Approximating the Minimum Consistent OBDD Problem.**[Citation Graph (0, 0)][DBLP] SWAT, 1996, pp:112-123 [Conf] - Kosuke Ono, Masateru Harao, Kouichi Hirata
**Multi-Agent Based Modeling and Simulation of Consensus Formations in Arguments.**[Citation Graph (0, 0)][DBLP] ICITA (1), 2005, pp:264-267 [Conf] - Shogo Ozaki, Masateru Harao, Kouichi Hirata
**Performance Analysis for Construction of a Performance Practice Support System.**[Citation Graph (0, 0)][DBLP] ICITA (2), 2005, pp:415-418 [Conf] - Kouichi Hirata
**Rule-Generating Abduction for Recursive Prolog.**[Citation Graph (0, 0)][DBLP] Informatica (Slovenia), 1996, v:20, n:1, pp:- [Journal] - Shinichi Shimozono, Kouichi Hirata, Ayumi Shinohara
**On the Hardness of Approximating the minimum Consistent Acyclic DFA and Decision Diagram.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:66, n:4, pp:165-170 [Journal] - Kouichi Hirata, Keizo Yamada, Masateru Harao
**Tractable and intractable second-order matching problems.**[Citation Graph (0, 0)][DBLP] J. Symb. Comput., 2004, v:37, n:5, pp:611-628 [Journal] - Kouichi Hirata
**Prediction-hardness of acyclic conjunctive queries.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:348, n:1, pp:84-94 [Journal] - Hiroshi Sakamoto, Kouichi Hirata, Hiroki Arimura
**Learning elementary formal systems with queries.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:1, n:298, pp:21-50 [Journal] - Takashi Katoh, Kouichi Hirata, Masateru Harao
**Mining Frequent Diamond Episodes from Event Sequences.**[Citation Graph (0, 0)][DBLP] MDAI, 2007, pp:477-488 [Conf] **Mining Frequent Bipartite Episode from Event Sequences.**[Citation Graph (, )][DBLP]**The Fifth Workshop on Learning with Logics and Logics for Learning (LLLL2007).**[Citation Graph (, )][DBLP]**Mining Frequent**[Citation Graph (, )][DBLP]*k*-Partite Episodes from Event Sequences.**The Sixth Workshop on Learning with Logics and Logics for Learning (LLLL2009).**[Citation Graph (, )][DBLP]**Discovering Networks for Global Propagation of Influenza A (H3N2) Viruses by Clustering.**[Citation Graph (, )][DBLP]**A Simple Characterization on Serially Constructible Episodes.**[Citation Graph (, )][DBLP]**An Efficient Unordered Tree Kernel and Its Application to Glycan Classification.**[Citation Graph (, )][DBLP]**Sibling Distance for Rooted Labeled Trees.**[Citation Graph (, )][DBLP]**A Tree Distance Function Based on Multi-sets.**[Citation Graph (, )][DBLP]**A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences.**[Citation Graph (, )][DBLP]**On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay.**[Citation Graph (, )][DBLP]**Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes.**[Citation Graph (, )][DBLP]
Search in 0.050secs, Finished in 0.053secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |