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 8 Issue 2
April  1993
Turn off MathJax
Article Contents
Abstract
References
Related Articles
Shen Yidong, Tong Fu, Cheng Daijie. On Local StratifiabUity of Logic Programs and Databases[J]. Journal of Computer Science and Technology, 1993, 8(2): 3-11.
Citation: Shen Yidong, Tong Fu, Cheng Daijie. On Local StratifiabUity of Logic Programs and Databases[J]. Journal of Computer Science and Technology, 1993, 8(2): 3-11.
shu

On Local StratifiabUity of Logic Programs and Databases

  • Department; Computer; Science; Chongqing; University; 630044;

More Information
  • Published Date: April 09, 1993
    Abstract
  • 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.
    • FullText(HTML)
    • References (3)
  • [1]
    Loveland.D.B., Automated Theorem Proving: A Logic Basis. North-Holland, 1978.
    [2]
    Clark.K.L., Negation as Failure. In Logic and Databases (H.Gallaire and J.Minker, Eds.), Plenum, New York, 1978, pp.293-322.
    [3]
    Lloyd.J.W., Foundations of Logic Programming. Springer-Verlag, 1984. ……….
    • Relative Articles

  • Related Articles

    [1]George W. Hart. An Algorithm for Constructing 3D Struts[J]. Journal of Computer Science and Technology, 2009, 24(1): 56-64.
    [2]Min Zhao, Su-Qing Han, Jue Wang. Tree Expressions for Information Systems[J]. Journal of Computer Science and Technology, 2007, 22(2): 297-307.
    [3]Yun-Jun Gao, Chun Li, Gen-Cai Chen, Ling Chen, Xian-Ta Jiang, Chun Chen. Efficient k-Nearest-Neighbor Search Algorithms for Historical Moving Object Trajectories[J]. Journal of Computer Science and Technology, 2007, 22(2): 232-244.
    [4]LIU Yunlong, CHEN Junliang. Garbage Collection in Uncoordinated Checkpointing Algorithms[J]. Journal of Computer Science and Technology, 1999, 14(3): 242-249.
    [5]ZHANG Mingyi, ZHANG Ying. Characterizations and Algorithms of Extensionsfor CADL and QDL[J]. Journal of Computer Science and Technology, 1999, 14(2): 140-145.
    [6]Lu Weifeng, Zhang Yuping. Experimental Study on Strategy of CombiningSAT Algorithms[J]. Journal of Computer Science and Technology, 1998, 13(6): 608-614.
    [7]Zhou Jianqiang, Xie Li, Dai Fei, Sun Zhongxiu. Adaptive Memory Coherence Algorithms in DSVM[J]. Journal of Computer Science and Technology, 1994, 9(4): 365-372.
    [8]Yao Rong, Kang Tai, Chen Tinghuai. Algorithms for the Determination of Cutsets in a Hypergraph[J]. Journal of Computer Science and Technology, 1990, 5(1): 41-46.
    [9]Lu Qi, Zhang Fubo, Qian Jiahua. Program Slicing:Its Improved Algorithm and Application in Verification[J]. Journal of Computer Science and Technology, 1988, 3(1): 29-39.
    [10]Pan Yangsheng. An Analysis of WS and PFF Algorithms[J]. Journal of Computer Science and Technology, 1987, 2(2): 145-156.
    • Supplements (0)

Catalog

    Get Citation
    PDF
    XML
    Article views (24) PDF downloads (1328) 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