We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
SHAO Zhiqing, SUN Yongqiang, SONG Guoxin, YU Huiqun. Deciding Quasi-Reducibility Using Witnessed Test Sets[J]. Journal of Computer Science and Technology, 1999, 14(2): 146-152.
Citation: SHAO Zhiqing, SUN Yongqiang, SONG Guoxin, YU Huiqun. Deciding Quasi-Reducibility Using Witnessed Test Sets[J]. Journal of Computer Science and Technology, 1999, 14(2): 146-152.

Deciding Quasi-Reducibility Using Witnessed Test Sets

More Information
  • Published Date: March 09, 1999
  • A new approach to deciding quasi-reducibility is proposed by intro- ducing witnesses. Furthermore, an algorithm for constructing witnessed test sets of lelh-linear rewrite systems h. been designed. Compared with the standard test set approach presented by Kapur, Narendran and Zhang, the method proposed generates test sets of smaller size and therefore has more efficient applications .
  • [1]
    Kapur D, Musser D R. Inductive reasoning with incomplete specifications. In Proceedings of Logic in Computer Scierece Conference, Cambridge, MA, 1986, pp.367-377.
    [2]
    Jouannaud J -P, Kounalis E. Automatic proofs by induction in theories without constructors. Informatiion and Computation, 1989, 82: 1-33.
    [3]
    Kapur D, Narendran P, Zhang H. Automating inductionless induction using test sets. Journal of Symbolic Computation, 1991, 11: 83-111.
    [4]
    Schmid K, Fettig R. Towards an efficient construction of test sets for deciding ground reducibility. Lecture Notes ire Computer Science, 1995, 914: 86-100. ……….

Catalog

    Article views (14) PDF downloads (1302) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return