We use cookies to improve your experience with our site.

Indexed in:

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

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 13 Issue 1
January  1998
Turn off MathJax
Article Contents
Abstract
References
Related Articles
Hu Yunfa, Wolfgang Bibel. Reduction of Cycle Unification of Type Cpg+r[J]. Journal of Computer Science and Technology, 1998, 13(1): 18-24.
Citation: Hu Yunfa, Wolfgang Bibel. Reduction of Cycle Unification of Type Cpg+r[J]. Journal of Computer Science and Technology, 1998, 13(1): 18-24.
shu

Reduction of Cycle Unification of Type Cpg+r

  • Department of Computer Science; Fudan University; Shanghai 200J433; P.R. China Fachgebiet Intellektik; Technische Hochschule Darmstadt; Germany;

More Information
  • Published Date: January 09, 1998
    Abstract
  • In this paper a class of cycle unification problems called type Cpg+r is studied, and an intuitive representation method, called the position supergraph, is presented to analyze or reduce the cycle problem. A typical case of Cpg+r problems is considered and an algorithm is given, which transforms the original problem of Cpg+r that is of the exponential complexity into a new one that is of the linear complexity when using SLD resolution method. These results are of importance for practice and theory.
    • FullText(HTML)
    • References (3)
  • [1]
    Bibel W, Holldobler S, Murtz J. Cycle unification. In Proc. the Conference on Automated Deduction, Springer, Berlin, 1992, pp.94-108.
    [2]
    Bruning Stefan. Techniques for avoiding redundancy. In Theorem Proving Based on the Connection Method, Doctor's Thesis D17, TH Darmstadt, 1994.
    [3]
    Eder E. Properties of substitutions and unifications. Journal of Symbolic Computation, 1985, 1: 31-46. ……….
    • Relative Articles

  • Related Articles

    [1]Yuan-Bo Guo, Jian-Feng Ma. Practical Secret Sharing Scheme Realizing Generalized Adversary Structure[J]. Journal of Computer Science and Technology, 2004, 19(4).
    [2]Wang Jue, Miao Duoqian. Analysis on Attribute Reduction Strategies of Rough Set[J]. Journal of Computer Science and Technology, 1998, 13(2): 189-193.
    [3]Liu Xuhua, Sun Jigui. Generalized Resolution and NC-Resolution[J]. Journal of Computer Science and Technology, 1994, 9(2): 160-167.
    [4]Gao Ji. Functional Knowledge Representation Based on Problem Reduction[J]. Journal of Computer Science and Technology, 1992, 7(2): 105-113.
    [5]Wang Dingxing, Zheng Weimin, Du Xiaoli, Guo Yike. On the Execution Mechanisms of Parallel Graph Reduction[J]. Journal of Computer Science and Technology, 1990, 5(4): 333-346.
    [6]Yu Xiangdong. Some Hard Examples for the Resolution Method[J]. Journal of Computer Science and Technology, 1990, 5(3): 302-304.
    [7]Zhang Bo, Zhang Tian, Zhang Jianwei, Zhang Ling. Motion Planning for Robots with Topological Dimension Reduction Method[J]. Journal of Computer Science and Technology, 1990, 5(1): 1-16.
    [8]Harald E. Otto. Reduction of Unnecessary Dotted Rules in the Earley-Algorithm[J]. Journal of Computer Science and Technology, 1989, 4(4): 344-352.
    [9]Wu Yihua. Discovering natural laws by Reduction[J]. Journal of Computer Science and Technology, 1989, 4(1): 35-51.
    [10]Wang Xuan, Lü Zhimin, Tang Yuhai, Xiang Yang. A High Resolution Chinese Character Generator[J]. Journal of Computer Science and Technology, 1986, 1(2): 1-14.
    • Supplements (0)

Catalog

    Get Citation
    PDF
    XML
    Article views (16) PDF downloads (1118) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return