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 April 1993, Volume 8 Issue 2 Previous Issue    Next Issue
    For Selected: View Abstracts Toggle Thumbnails
    Articles
    On Local StratifiabUity of Logic Programs and Databases
    Shen Yidong; Tong Fu; Cheng Daijie;
    Journal of Computer Science and Technology, 1993, 8 (2): 3-11. 
    Abstract   PDF(457KB) ( 1299 )   Chinese Summary
    In this paper,we deal with the problem of verifying local stratifiability of logic programs and databases presented by Przymusinski.Necessary and sufficient conditions for the local stratifiability of logic programs are presented and algorithms for performing the verification are developed.Finally,we prove that a database DB containing clauses with disjunctive consequents can be easily converted into a logic program P such that DB is locally stratified iff P is locally stratified.
    References | Related Articles | Metrics
    A Fixpoint Semantics for Stratified Databases
    Shen Yidong;
    Journal of Computer Science and Technology, 1993, 8 (2): 12-21. 
    Abstract   PDF(557KB) ( 1095 )   Chinese Summary
    Przymusinski extended the notion of stratified logic programs,developed by Apt,Blair and Walker,and by van Gelder,to stratified databases that allow both negative premises and disjunctive consequents.However,he did not provide a fixpoint theory for such class of databases.On the other hand,although a fixpoint semantics has been developed by Minker and Rajasekar for non-Horn logic programs,it is tantamount to traditional minimal model semantics which is not sufficient to capture the intended meaning of negat…
    References | Related Articles | Metrics
    Inductive Learning
    Wu Xindong;
    Journal of Computer Science and Technology, 1993, 8 (2): 22-36. 
    Abstract   PDF(571KB) ( 1164 )   Chinese Summary
    Machine learning(ML)is a major subfield of artificial intelligence(AI).It has been seen as a feasi- ble way of avoiding the knowledge bottleneck problem in knowledge-based systems development.Re- search on ML has concentrated in the main on inductive learning,a paradigm for inducing rules from unordered sets of exmaples.AQ11 and ID3,the two most widespread algorithms in ML,are both induc- tive.This paper first summarizes AQ11,ID3 and the newly-developed extension matrix approach based HCV algorithm;and then…
    References | Related Articles | Metrics
    Validating Inductive Hypotheses by Mode Inference
    Wang Zhijian;
    Journal of Computer Science and Technology, 1993, 8 (2): 37-41. 
    Abstract   PDF(160KB) ( 1185 )   Chinese Summary
    Some criteria based on mode inference for validating inductive hypotheses are presented in this pa- per.Mode inference is carried out mechanically,thus such kind of validation can result in low overhead in consistency check and high efficiency in performance.
    References | Related Articles | Metrics
    Design Rationale for a Wide Spectrum Specification Language FGSPEC
    Lu Jian; Xu Jiafu;
    Journal of Computer Science and Technology, 1993, 8 (2): 42-50. 
    Abstract   PDF(310KB) ( 1435 )   Chinese Summary
    FGSPEC is a wide spectrum specification language intended to facilitate the software specification and the expression of transformation process from the functional specification which describes“what to do”to the corresponding design(operational)specification which describes“how to do”.The design emphasizes the coherence of multi-level specification mechanisms and a tree structure model is provided which unifies the wide spectrum specification styles from“what”to“how”.
    References | Related Articles | Metrics
    Two New Strategies for Developing Loop Invariants and Their Applications
    Xue Jinyun;
    Journal of Computer Science and Technology, 1993, 8 (2): 51-58. 
    Abstract   PDF(283KB) ( 1343 )   Chinese Summary
    The loop invariants take a very important role in the design,proof and derivation of the algorithmic program.We point out the limitations of the traditional standard strategy for developing loop invariants, and propose two new strategies for proving the existing algorithmic program and developing new ones. The strategies use recurrence as vehicle and integrate some effective methods of designing algorithms, e.g.Dynamic Programming,Greedy and Divide Conquer,into the recurrence relation of problem solving seq…
    References | Related Articles | Metrics
    A Standard Model-Theoretic Approach to Operational Semantics of Recursive Programs
    Shao Zhiqing;
    Journal of Computer Science and Technology, 1993, 8 (2): 59-65. 
    Abstract   PDF(391KB) ( 1434 )   Chinese Summary
    In this paper we try to introduce a new approach to operational semantics of recursive programs by using ideas in the“priority method”which is a fundamental tool in Recursion Theory.In lieu of modelling partial functions by introducing undefined values in a traditional approach,we shall define a priority derivation tree for every term,and by respecting the rule“attacking the subterm of the highest priority first”we define transition relations,computation sequences etc.directly based on a standard interpreta…
    References | Related Articles | Metrics
    Nonterminating Rewritings with Head Boundedness
    Chen Yiyun;
    Journal of Computer Science and Technology, 1993, 8 (2): 66-75. 
    Abstract   PDF(561KB) ( 1349 )   Chinese Summary
    We define here the concept of head boundedness,head normal form and head confluence of term rewriting systems that allow infinite derivations.Head confluence is weaker than confluence,but suffi- cient to guarantee the correctness of lazy implementations of equational logic programming languages. Then we prove several results.First,if a left-linear system is locally confluent and head-bounded,then it is head-confluent.Second,head-confluent and head-bounded systems have the head Church-Rosser proper- ty.Last,…
    References | Related Articles | Metrics
    OOMMS:A Module Management System Based on an Object-Oriented Model
    Pong Man-Chi; Zhang Yongguang; Xu Hong; Ding Jie;
    Journal of Computer Science and Technology, 1993, 8 (2): 76-85. 
    Abstract   PDF(527KB) ( 1150 )   Chinese Summary
    This paper describes the design rationale of OOMMS,a module management system based on an object-oriented model.The concepts of object and module are defined.Modules refer to the software products in general which have interface parts and body parts.Related concepts of a cluster of modules,versions of a module,and revisions of a version are also defined.The tools for checking in C program modules into OOMMS are discussed.
    References | Related Articles | Metrics
    Deductive Fault Simulation Algorithm Based on Fault Collapsing
    Gong Yunzhan; Wei Daozheng;
    Journal of Computer Science and Technology, 1993, 8 (2): 86-91. 
    Abstract   PDF(312KB) ( 1171 )   Chinese Summary
    The true value simulation is necessary in the critical path tracing fault simulation algorithm.The critical and non-critical inputs can be known after the number of controlling and non-controlling inputs and the criticality of output of every gate are determined.Single output region(SOR)is defined for non-critical lines,so many other non-critical lines can be obtained before fault simulation.Then deductive fault simulation algorithm is used to compute the fault list for every possible critical line from bot…
    References | Related Articles | Metrics
    A Knowledge-Based Specification Technique for Protocol Development
    Zhang Yaoxue; Shi Meilin; Norio Shiratori;
    Journal of Computer Science and Technology, 1993, 8 (2): 92-96. 
    Abstract   PDF(164KB) ( 1301 )   Chinese Summary
    This paper proposes a knowledge-based specification technique(KST)for protocol development. This technique semi-automatically translates a protocol described in an informal description(natural languages or graphs)into one described in formal specifications(Estelle and SDL).The translation processes are supported by knowledge stored in the knowledge base.This paper discusses the concept, the specification control mechanism of KST and the rules and algorithms for production of FSM's which is the basis of Este…
    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