Bimonthly    Since 1986
ISSN 1000-9000(Print)
CN 11-2296/TP
Indexed in:
Publication Details
Edited by: Editorial Board of Journal Of Computer Science and Technology
P.O. Box 2704, Beijing 100190, P.R. China
Sponsored by: Institute of Computing Technology, CAS & China Computer Federation
Undertaken by: Institute of Computing Technology, CAS
Distributed by:
China: All Local Post Offices
Other Countries: Springer
  • Table of Content
      10 April 1992, Volume 7 Issue 2 Previous Issue    Next Issue
    For Selected: View Abstracts Toggle Thumbnails
    A Generalization of Circumscription
    Lin Zuoquan; Shi Chunyi;
    Journal of Computer Science and Technology, 1992, 7 (2): 97-104. 
    Abstract   PDF(390KB) ( 1309 )   Chinese Summary
    In this paper we firstly extend McCarthy s circumscription to modal logics.Similar to circumscribing predicates,we circumscribe the critical modal operator(the operator to be minimized)in a formula.The modal formulation of circumscription is completely characterized by the minimal model such as the predicate circumscription,The circumscriptive ignorance of the agent s self-knowledge by circumscribing knowledge operator is then illustrated.We further suggest that the merit of circumscription is basic for non…
    References | Related Articles | Metrics
    Functional Knowledge Representation Based on Problem Reduction
    Gao Ji;
    Journal of Computer Science and Technology, 1992, 7 (2): 105-113. 
    Abstract   PDF(424KB) ( 1129 )   Chinese Summary
    This paper proposes an approach for functional knowledge representation based on problem reduction,which represents the organization of problem-solving activities in two levels:reduction and reasoning.The former makes the functional plans for problem-solving while the latter constructs functional units, called handlers,for executing subproblems designated by these plans.This approach emphasizes that the representation of domain knowledge should be closely combined with(rather than separated from)its use the…
    References | Related Articles | Metrics
    On the Complexities of Non-Horn Clause Logic Programming
    Nie Xumin;
    Journal of Computer Science and Technology, 1992, 7 (2): 114-122. 
    Abstract   PDF(385KB) ( 1288 )   Chinese Summary
    There have been active work to extend the Prolog style Horn Clause logic programming to non-Horn clauses.In this paper,we will analyze the complexities of several such extensions.The purpose is to understand the computational complexity of these inference systems.The analyses do not prove that any one system is better than the others all the time.But they do suggest that one system may be better than the others for some particular problems.We also discuss the effect of caching.
    References | Related Articles | Metrics
    The Distributed Logical Reasoning Language D_Tuili and Its Implementation on Microcomputer Network
    Gao Quanquan; Lu Ruqian; Cao Hua; Zhang Songmao;
    Journal of Computer Science and Technology, 1992, 7 (2): 123-135. 
    Abstract   PDF(1018KB) ( 1512 )   Chinese Summary
    D-Tuili,having been implemented on microcomputer network,is a distributed logical rea- soning programming language.D-Tuili supports parallel programming on the language level,and couples loosely with the distributed database management system,so data in distributed databases can be used in the distributed logic programs.In this paper,we mainly introduce the components of D-Tuili used to design distributed logic programs.Furthermore,the main principles to imple- ment D-Tuili and the main technologies adopted…
    References | Related Articles | Metrics
    DKLFRS:A Default Knowledge Logical Framework Representation System
    Fan Zhongchun; Xing Hancheng;
    Journal of Computer Science and Technology, 1992, 7 (2): 136-142. 
    Abstract   PDF(295KB) ( 1243 )   Chinese Summary
    The traditional reasoning system based on first order predicate logic can t represent and handle de- fault knowledge.This paper presents a logical framework representation approach for default reasoning. Based on Mixed SLDNF-resolution,a nonmonotonic reasoning system has been constructed.
    References | Related Articles | Metrics
    Improvements on Certainty Factor Model and Its Application to Conflict Resolution in CDPS
    Wang Hui; Liu Dayou;
    Journal of Computer Science and Technology, 1992, 7 (2): 143-152. 
    Abstract   PDF(262KB) ( 1097 )   Chinese Summary
    In this paper some improvements on certainty factor model are discussed aiming at:1)including, in a rule“E→H”,not only the CF of H when E exists but also CF of(?)when E does not exist(partly or completely).For this purpose another factor(?)is added into the original model;2) improving the model so that it can tackle problems with unknown evidence.In this aspect two concepts are introduced:(relative)maximum existence risk and(relative)maximum non-existence risk.An impor- tant result is that even if some nece…
    References | Related Articles | Metrics
    Specification Language NUJSL Based on JSP and Its Supporting System
    Xu Yongsen; He Biao;
    Journal of Computer Science and Technology, 1992, 7 (2): 153-163. 
    Abstract   PDF(226KB) ( 1498 )   Chinese Summary
    This paper presents the specification language NUJSL and its supporting system.NUJSL is a modular specification language based on Jackson Program Design Method(JSP).With the module construction,it is convenient to use NUJSL to write larger specifications.The supporting system supports the incremental develop- ment of software specification in NUJSL,and implements the transformation both from specification to software procedural description in Jackson Schematic Logic(pseudo code)and from procedural descripti…
    References | Related Articles | Metrics
    Probabilistic Models for Estimation of Random and Pseudo-Random Test Length
    Xiang Dong; Wei Daozheng; Chen Shisong;
    Journal of Computer Science and Technology, 1992, 7 (2): 164-174. 
    Abstract   PDF(478KB) ( 1064 )   Chinese Summary
    A new probabilistic testability measure is presented to ease test length analyses of random testing and pseudorandom testing.The testability measure given in this paper is oriented to signal conflict of reconvergent fanouts.Test length analyses in this paper are based on a hard fault set,calculations of which are practicable and simple.Experimental results have been obtained to show the accuracy of this test length analyser in comparison with that of Savir,Chin and McCluskey,and Wunderlich by using a pseudo…
    References | Related Articles | Metrics
    A Multiple-Valued Algebra for Modeling MOS VLSI Circuits at Switch-Level
    Hu Mou;
    Journal of Computer Science and Technology, 1992, 7 (2): 175-184. 
    Abstract   PDF(405KB) ( 1234 )   Chinese Summary
    A multiple-valued algebra for modeling MOS VLSI circuits at switch-level is proposed in this paper. Its structure and properties are studied.This algebra can be used to transform a MOS digital circuit to a switch-level algebraic expression so as to generate the truth table for the circuit and to derive a Boolean expression for it.In the paper,methods to construct a switch-level algebraic expression for a circuit and methods to simplify expressions are given.This algebra provides a new tool for MOS VLSI circ…
    References | Related Articles | Metrics
    A Theory for the Initial Allocating of Real Time Tasks in Distributed Systems
    Yan Yong; Jin Canming;
    Journal of Computer Science and Technology, 1992, 7 (2): 185-188. 
    Abstract   PDF(95KB) ( 1056 )   Chinese Summary
    Referring to a set of real time tasks with arriving time,executing time and deadline,this paper discusses the problem of polynomial time initial-allocating approximation algorithms in a distributed system and five new results are gained which provide a theory for the designing of initial-allocating algorithms of real time tasks.
    References | Related Articles | Metrics
    The Decomposition of Belief Function
    Zheng Fangqing;
    Journal of Computer Science and Technology, 1992, 7 (2): 189-192. 
    Abstract   PDF(87KB) ( 1199 )   Chinese Summary
    This paper presents a necessary condition for a belief function to be a separable support function,and ne- cessary and sufficient conditions for a belief function with hierarchical focal elements to be decomposed into sim- ple support functions.In the second case,an explicit formula is given for the decomposition.
    References | Related Articles | Metrics
  Journal Online
Just Accepted
Top Cited Papers
Top 30 Most Read
Paper Lists of Areas
Special Issues
   ScholarOne Manuscripts
   Log In

User ID:


  Forgot your password?

Enter your e-mail address to receive your account information.

ISSN 1000-9000(Print)

CN 11-2296/TP

Editorial Board
Author Guidelines
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
E-mail: jcst@ict.ac.cn
  Copyright ©2015 JCST, All Rights Reserved