リサーチレポートや技術報告(JAIST)

北陸先端科学技術大学院大学 外山・酒井研 (1993.4-1997.3)／外山研 (1997.4-2000.3)におけるリサーチレポートや技術報告です．

1. T.Matsumoto, Y.Toyama,
   On Confluence Conditions of Left-linear Term Rewriting Systems,
   Tech. Rep. of IEICE, COMP99-62(1999-12), pp. 49-55, 1999.
2. K.Kusakari, M.Nakamura, Y.Toyama,
   Argument Filtering Transformation,
   Res. Rep. IS-RR-99-0008F, School of Information Science, JAIST, 1999.
3. K.Kusakari, Y.Toyama,
   The Hierarchy of Dependency Pairs,
   Res. Rep. IS-RR-99-0007F, School of Information Science, JAIST, 1999.
4. K.Kusakari, Y.Toyama,
   On Proving AC-Termination by Argument Filtering Method,
   Res. Rep. IS-RR-99-0006F, School of Information Science, JAIST, 1999.
5. K.Kusakari, Y.Toyama,
   On Proving Termination of Term Rewriting Systems by Pruning Method,
   Tech. Rep. of IEICE, COMP98-432(1998-11), pp. 49-56, 1998.
6. M.Nakamura, Y.Toyama,
   On Proving Termination by General Dummy Elimination,
   Tech. Rep. of IEICE, COMP98-432(1998-11), pp. 57-64, 1998.
7. H.Koike, Y.Toyama,
   Inductionless induction and rewriting induction,
   Tech. Rep. of IEICE, COMP98-432(1998-11), pp. 65-72, 1998.
8. M. Iwami, Y. Toyama,
   Simplification ordering for higher-order rewrite systems,
   Res. Rep. IS-RR-98-0024F, School of Information Science, JAIST, 1998.
9. K.Kusakari, Y.Toyama,
   On Proving AC-Termination by AC-Dependency Pairs,
   Res. Rep. IS-RR-98-0026F, School of Information Science, JAIST, 1998.
10. K.Kusakari, Y.Toyama,
    On Proving AC-Termination by Dependency Pairs,
    Tech. Rep. of IEICE, COMP97-112(1998-03), pp. 47-54, 1998.
11. T. Aoto,
    A proof of the conjecture of Zantema on a persistent property of term rewriting systems,
    Res. Rep. IS-RR-98-0008F, School of Information Science, JAIST, 1998.
12. T. Aoto, H. Shirasu,
    On the finite model property of intuituitionistic modal logics over MIPC,
    Res. Rep. IS-RR-98-0004F, School of Information Science, JAIST, 1998.
13. T. Nagaya, M. Matsumoto, K. Ogata, K. Futatsugi,
    The equivalence of the reductions with the E-strategy with and without marks,
    Res. Rep. IS-RR-97-0034F, School of Information Science, JAIST, 1997.
14. T. Aoto, Y. Toyama,
    Tree lifting orderings for termination transformations of term rewriting systems,
    Res. Rep. IS-RR-97-0033F, School of Information Science, JAIST, 1997.
15. M. Iwami, M. Sakai, Y. Toyama,
    An improved recursive decomposition ordering for higher-order rewrite systems,
    Tech. Rep. of IEICE, COMP97-73(1997-01), pp. 17-24, 1997.
16. T. Nagaya, M. Sakai, Y. Toyama,
    Index reduction of overlapping strongly sequential systems,
    Tech. Rep. of IEICE, COMP96-32(1996-09), pp. 39-48, 1996.
17. T. Aoto, Y. Toyama,
    Extending persistency of confluence with ordered sort,
    Tech. Rep. of IEICE, COMP96-31(1996-09), pp. 29-38, 1996.
18. T. Aoto, Y. Toyama,
    Extending persistency of confluence with ordered sorts,
    Res. Rep. IS-RR-96-0025F, School of Information Science, JAIST, 1996.
19. T. Aoto, Y. Toyama,
    Top-down labelling and modularity of term rewriting systems,
    Res. Rep. IS-RR-96-0023F, School of Information Science, JAIST, 1996.
20. K. Nakano, M. Sakai, Y. Toyama,
    Termination for associative-commutative term rewriting systems,
    Tech. Rep. of IEICE, COMP95-104(1996-03), pp. 29-38, 1996 (in japanese).
21. T. Aoto, Y. Toyama,
    Persistency of confluence,
    Res. Rep. IS-RR-96-0009F, School of Information Science, JAIST, 1996.
22. K. Kusakari, M. Sakai, Y. Toyama,
    Church-Rosser property of non-linear term rewriting systems,
    Tech. Rep. of IEICE, COMP95-86(1996-01), pp. 123-129, 1996 (in japanese).
23. M. Iwami, M. Sakai, Y. Toyama,
    On the termination of higher order rewrite systems,
    Tech. Rep. of IEICE, COMP95-85(1996-01), pp. 113-121, 1996 (in japanese).
24. M. Sakai, Y. Toyama,
    The semantics of priority term rewriting systems and their sequentiality,
    Tech. Rep. of IEICE, SS95-40(1996-01), pp. 31-38, 1996.
25. M. Oyamaguchi, Y. Toyama,
    On the Church-Rosser property of E-overlapping and simple-right-linear TRS's,
    Res. Rep. of the Faculty of Engineering, Mie University, Vol. 10, 1995.
26. M. Sakai,
    The functional strategy - the extended left-imcompatible systems,
    Tech. Rep. of IEICE, SS95-17(1995-07), pp. 55-62, 1995.
27. A. Kitahara, M. Sakai, Y. Toyama,
    On the modularity of confluent term rewriting systems with shared constructors,
    Tech. Rep. of ISPJ, 95-PRG-20, pp. 11-20, 1995 (in japanese).
28. T. Nagaya, M. Sakai, Y. Toyama,
    Decidability of indices on NVNF-sequential term rewriting systems,
    Tech. Rep. of IEICE, COMP94-63(1994-11), pp. 87-94, 1994 (in japanese).
29. Y. Takahashi, M. Sakai, Y. Toyama,
    On the confluence of conditional term rewriting systems,
    Tech. Rep. of IEICE, COMP94-65(1994-11), pp. 105-111, 1994 (in japanese).
30. M. Oyamaguchi, Y. Toyama,
    On the Church-Rosser property of E-overlapping and simple-right-linear TRS's,
    Tech. Rep. of IEICE, COMP94-29(1994-07), pp. 47-56, 1994.
31. M. Sakai, S. Matsui, M. Kawakita, K. Agusa,
    Similarity on algebraic specifications toward specification detabases,
    Res. Rep. IS-RR-94-0012S, School of Information Science, JAIST, 1994.
32. H. Kasuya, M. Sakai, S. Yamamoto, K. Agusa,
    Term set rewriting system and invesitigations on Knuth-Bendix completion,
    Tech. Rep. of IEICE, SS93-41(1994-01), pp. 17-22, 1994 (in japanese).