Loading...




Bimonthly    Since 1986
ISSN 1000-9000(Print)
/1860-4749(Online)
CN 11-2296/TP
Indexed in:
SCIE, Ei, INSPEC, JST, AJ, MR, CA, DBLP, etc.
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
Published by: SCIENCE PRESS, BEIJING, CHINA
Distributed by:
China: All Local Post Offices
Other Countries: Springer
 
ip访问总数:
ip当日访问总数:
当前在线人数:
  • Table of Content
      10 May 1995, Volume 10 Issue 3 Previous Issue    Next Issue
    For Selected: View Abstracts Toggle Thumbnails
    Articles
    A Logical Framework for Knowledge Base Maintenance
    Li wei;
    Journal of Computer Science and Technology, 1995, 10 (3): 193-205. 
    Abstract   PDF(264KB) ( 1231 )   Chinese Summary
    The maintenance sequences of a knowledge base and their limits are intro-duced. Some concepts used in knowledge base maintenance, such as new laws,user's rejections, and reconstructions of a knowledge base are defined; the re-lated theorems are proved. A procedure is defined using transition systems; itgenerates maintenance sequences for a given user's model and a knowledge base.It is proved that all sequences produced by the procedure are convergent, andtheir limit is the set of true sentences of the model…
    References | Related Articles | Metrics
    Automatic Construction of Finite Algebras
    Zhang Jian;
    Journal of Computer Science and Technology, 1995, 10 (3): 206-213. 
    Abstract   PDF(153KB) ( 1248 )   Chinese Summary
    This paper deals with model genemtion for equational theories, i.e, auto-matically generating (finite) models of a given set of (logical) equations. Ourmethod of finite model generation and a tool for automatic construction of finitealgebras is described. Some examples are given to show the applications of ourprogram. We argue that, the combination of model generators and theoremprovers enables us to get a better understanding of logical theories. A briefcomparison between our tool and other similar tools i…
    References | Related Articles | Metrics
    Denotational Semantics of a Simple Model of Eiffel
    Qu Yuzhong; Wang Zhijian; Xu Jiafu;
    Journal of Computer Science and Technology, 1995, 10 (3): 214-226. 
    Abstract   PDF(271KB) ( 1589 )   Chinese Summary
    A simple abstract model of Eiffel is introduced, and its denotational seman-tics is defined using VDM style. A static analysis approach is presented to treatmultiple inheritance and renaming mechanism. Within the framework of deno-tational semantics iatroduced in this paper, the key features of Eiffel, such asidentification, classification, multiple inheritance, polymorphism and dynamicbinding, can be adequately characterized.
    References | Related Articles | Metrics
    A Formal Semantics for DAI Language NUML
    Xu Manwu; Lu Jianfeng; Zeng Fancong; Dai Jinwn;
    Journal of Computer Science and Technology, 1995, 10 (3): 227-238. 
    Abstract   PDF(482KB) ( 1428 )   Chinese Summary
    Traditional AI systems are brittle in the sense that they fail miserably whenpresented with problems even slightly outside of their limited range of expertise.A powerful, extensible strategy of Distributed Artificial Intelligence (DAI) forovercoming such bounds is to put the system in a society of systems. So theability to coordinate group activities of individuals and to communicate betweeneach other is necessary for a language describing DAI systems. Agent-orientedlanguage NUML is such a language. It is a…
    References | Related Articles | Metrics
    S-and T-Invariants in Cyber Net Systems
    Yuan Chongyi;
    Journal of Computer Science and Technology, 1995, 10 (3): 239-252. 
    Abstract   PDF(564KB) ( 1341 )   Chinese Summary
    Cyber nets are also known as self modifying nets. Though proposed anddefined some 20 years ago, they have never been under thorough study eversince. The reason for this is simple: the nonlinear nature of such nets keeps themaway from applications of well developed methods known to the whole Petri NetSociety in the world. This paper attempts to make a start of studying cybernets in depth by proposing a way to define and to verify S-invariants and T-invariants in such nets. These invariants reflect important …
    References | Related Articles | Metrics
    Nonuniform Lowness and Strong Nonuniform Lowness
    Li Hongzhou; Li Guanying;
    Journal of Computer Science and Technology, 1995, 10 (3): 253-258. 
    Abstract   PDF(293KB) ( 1316 )   Chinese Summary
    The concepts of the nonuniform and strong nonuniform lownesss are in-troduced. Those notions provide a uniform framework to study connectionsbetween the polynomiaLtime hierarchy and sparse sets.
    Related Articles | Metrics
    Putting Consistent Theories Together in Institutions
    Ying Mingsheng;
    Journal of Computer Science and Technology, 1995, 10 (3): 260-266. 
    Abstract   PDF(180KB) ( 1634 )   Chinese Summary
    The problem of putting consistent theories together in institutions is dis-cussed. A general necessary condition for consistency of the resulting theory iscarried out, and some sufficient conditions are given for diagrams of theories inwhich shapes are tree bundles or directed graphs. Moreover, some transforma-tions from complicated cases to simple ones are established.
    References | Related Articles | Metrics
    Institutions of Variable Truth Values:An Approach in the Ordered Style
    Ying Mingsheng;
    Journal of Computer Science and Technology, 1995, 10 (3): 267-273. 
    Abstract   PDF(319KB) ( 1416 )   Chinese Summary
    The concept of institution of variable truth values is introduced and somemain results about institutions are generalized. In particular, some propertiesof institutions of variable truth vaues preserved by change of truth values areestablished.
    References | Related Articles | Metrics
    A Three-Stage Knowledge Acquisition Method
    Cao Cungen; Liu Wei;
    Journal of Computer Science and Technology, 1995, 10 (3): 274-280. 
    Abstract   PDF(280KB) ( 1329 )   Chinese Summary
    This paper presents and analyzes three fundamental problems in knowledgeacquisition, and proposes a general method for tackling them. The methoddivides the whole process of knowledge acquisition into a set of almost indepen-dent pieces, each of which can be finished by knowledge engineers, experts andassistants, respectively.
    References | Related Articles | Metrics
    Head Boundedness of Nonterminating Rewritings
    Chen Yiyun;
    Journal of Computer Science and Technology, 1995, 10 (3): 281-284. 
    Abstract   PDF(180KB) ( 1482 )   Chinese Summary
    Further research about nonterminating rewritings is introduced. First, the previousdefinition of head boundedness is modified to exclude nonfair reduction sequences.A sufficient condition is then given to determine head boundedness of term rewritingsystems. The condition is then developed to a method to determine head boundednessof constructor systems.
    References | Related Articles | Metrics
    An Algebraic Characterization of Inductive Soundness in Proof by Consistency
    Shao Zhiqing; Song Guoxin;
    Journal of Computer Science and Technology, 1995, 10 (3): 285-288. 
    Abstract   PDF(100KB) ( 1267 )   Chinese Summary
    Kapur and Musser studied the theoretical basis for proof by consistency and ob-tained an inductive completeness result: p q if and only if p = q is true in everyinductive model. However, there is a loophole in their proof for the soundness part:p = q implies p = q is true in every inductive model. The aim of this paper is to give acorrect characterization of inductive soundness from an algebraic view by introducingstrong inductive models.
    References | Related Articles | Metrics
  Journal Online
Just Accepted
Archive
Top Cited Papers
Top 30 Most Read
Paper Lists of Areas
Surveys
Special Issues
  Download
   ScholarOne Manuscripts
   Log In

User ID:

Password:

  Forgot your password?

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

ISSN 1000-9000(Print)

         1860-4749(Online)
CN 11-2296/TP

Home
Editorial Board
Author Guidelines
Subscription
Journal of Computer Science and Technology
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
 
  Copyright ©2015 JCST, All Rights Reserved